A BSSS algorithm for the location problem with minimum square error.
Fathali, Jafar, Zaferanieh, Mehdi, Nezakati, Ahmad (2009)
Advances in Operations Research
Similarity:
Displaying similar documents to “Non orthogonal cutting problem the case of trapezoidal pieces.”
A BSSS algorithm for the location problem with minimum square error.
A derivation of Kohnert's algorithm from Monk's rule.
Winkel, Rudolf (2002)
Séminaire Lotharingien de Combinatoire [electronic only]
Similarity:
Permutations of the natural numbers with prescribed difference multisets.
Hegarty, Peter, Larsson, Urban (2006)
Integers
Similarity:
Determining lower bounds for packing densities of non-layered patterns using weighted templates.
Presutti, Cathleen Battiste (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Packing densities of patterns.
Barton, Reid W. (2004)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A bijective proof of a major index theorem of Garsia and Gessel.
Novick, Mordechai (2010)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Using homological duality in consecutive pattern avoidance.
Khoroshkin, Anton, Shapiro, Boris (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Differential geometry of grassmannians and the Plücker map
Sasha Anan’in, Carlos Grossi (2012)
Open Mathematics
Similarity:
Using the Plücker map between grassmannians, we study basic aspects of classic grassmannian geometries. For ‘hyperbolic’ grassmannian geometries, we prove some facts (for instance, that the Plücker map is a minimal isometric embedding) that were previously known in the ‘elliptic’ case.
Affine permutations of type .
Björner, Anders, Brenti, Francesco (1996)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Continuous reformulations and heuristics for the euclidean travelling salesperson problem
Tuomo Valkonen, Tommi Kärkkäinen (2009)
ESAIM: Control, Optimisation and Calculus of Variations
Similarity:
We consider continuous reformulations of the euclidean travelling salesperson problem (TSP), based on certain clustering problem formulations. These reformulations allow us to apply a generalisation with perturbations of the Weiszfeld algorithm in an attempt to find local approximate solutions to the euclidean TSP.
Two-machine flowshop scheduling problem to minimize makespan or total completion time with random and bounded setup times.
Allahverdi, Ali, Aldowaisan, Tariq, Sotskov, Yuri N. (2003)
International Journal of Mathematics and Mathematical Sciences
Similarity:
Mesh patterns and the expansion of permutation statistics as sums of permutation patterns.
Brändén, Petter, Claesson, Anders (2011)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
An application of the Fourier transform to optimization of continuous 2-D systems
Vitali Dymkou, Michael Dymkov (2003)
International Journal of Applied Mathematics and Computer Science
Similarity:
This paper uses the theory of entire functions to study the linear quadratic optimization problem for a class of continuous 2D systems. We show that in some cases optimal control can be given by an analytical formula. A simple method is also proposed to find an approximate solution with preassigned accuracy. Some application to the 1D optimization problem is presented, too. The obtained results form a theoretical background for the design problem of optimal controllers for relevant processes. ...