Searching for "Integer Programming and Combinatorial Optimization" – sorted by Relevance.
54 documents found, showing 1 through 10.
Next 10 →
-
Integration of Constraint Programming and Integer Programming for Combinatorial Optimization
- … Programming and Integer Programming for Combinatorial Optimization Greger Ottosson A Dissertation submitted…
- Cited by 1 (0 self) – Add To MetaCart
-
An Annotated Bibliography for Post-solution Analysis in Mixed Integer Programming and Combinatorial
- …. Keywords: integer programming, combinatorial optimization, sensitivity analysis, postoptimal analysis…
- Cited by 9 (0 self) – Add To MetaCart
-
The ABACUS System for Branch-and-Cut-and-Price Algorithms in Integer Programming and Combinatorial
- …-and-Cut-and-Price Algorithms in Integer Programming and Combinatorial Optimization MICHAEL J UNGER Institut fur Informatik…
- Cited by 6 (0 self) – Add To MetaCart
-
An Annotated Bibliography for Post-solution Analysis in Mixed Integer Programming and Combinatorial
- … is unbounded, anomalous or infeasible. Keywords: integer programming, combinatorial optimization, sensitivity…
- Add To MetaCart
-
Low-Dimensional Faces of Random 0/1-Polytopes. Integer Programming and Combinatorial Optimization
- … to beautiful structural results on combinatorial optimization problems, but also to powerful algorithms…
- Cited by 2 (0 self) – Add To MetaCart
-
Interior Point Methods For Global Optimization
- …, linear complementarity problem, integer programming, combinatorial optimization AMS(MOS) subject…
- Cited by 2 (1 self) – Add To MetaCart
-
Interior Point Methods in Semidefinite Programming with Applications to Combinatorial Optimization
- … combinatorial optimization problem with interior point methods, one needs its linear programming formulation…
- Cited by 387 (10 self) – Add To MetaCart
-
Valid inequalities and facets of the capacitated plant location problem
- … of interest in cutting plane algorithms for integer programs and combinatorial optimization problems. Papers…
- Cited by 9 (1 self) – Add To MetaCart
-
Separating Maximally Violated Comb Inequalities in Planar Graphs
- … Abstract The Traveling Salesman Problem (TSP) is a benchmark problem in combinatorial optimization…
- Cited by 9 (2 self) – Add To MetaCart
-
Minimizing Breaks by Maximizing Cuts
- … of the constraint programming community and by Michael Trick of the integer programming/combinatorial optimization…
- Cited by 13 (0 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
