519 search results - page 35 / 104 » A New Approach to Strongly Polynomial Linear Programming |
101
click to vote
DATE
2009
IEEE
15 years 8 months ago
2009
IEEE
—We propose a new methodology based on Mixed Integer Linear Programming (MILP) for determining the input values that will exercise a specified execution path in a program. In or...
142
click to vote
EVOW
2008
Springer
15 years 3 months ago
2008
Springer
Abstract. The Berth Allocation Problem (BAP) consists on programming and allocating ships to berthing areas along a quay. The BAP is modeled as a vehicle routing problem and a rece...
122
click to vote
SODA
2004
ACM
15 years 2 months ago
2004
ACM
We design polynomial time approximation schemes (PTASs) for Metric BISECTION, i.e. dividing a given finite metric space into two halves so as to minimize or maximize the sum of di...
135
click to vote
GECCO
2010
Springer
15 years 5 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...
127
click to vote
IWPEC
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Inclusion/exclusion branching is a way to branch on requirements imposed on problems, in contrast to the classical branching on parts of the solution. The technique turne...