The following pages link to (Q4735941):
Displaying 29 items.
- A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support (Q403644) (← links)
- A branch and cut solver for the maximum stable set problem (Q491210) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- On the exact separation of mixed integer knapsack cuts (Q543396) (← links)
- Lifting, tilting and fractional programming revisited (Q614041) (← links)
- A note on the relationship between the graphical traveling salesman polyhedron, the Symmetric Traveling Salesman Polytope, and the metric cone (Q708346) (← links)
- On the graphical relaxation of the symmetric traveling salesman polytope (Q877195) (← links)
- On the domino-parity inequalities for the STSP (Q985309) (← links)
- Local cuts revisited (Q1003489) (← links)
- Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation (Q1019294) (← links)
- Two- and three-index formulations of the minimum cost multicommodity \(k\)-splittable flow problem (Q1038381) (← links)
- Efficient filtering for the resource-cost alldifferent constraint (Q1701236) (← links)
- Dubins traveling salesman problem with neighborhoods: a graph-based approach (Q1736545) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- Generating partitions of a graph into a fixed number of minimum weight cuts (Q1952501) (← links)
- An integrated local-search/set-partitioning refinement heuristic for the capacitated vehicle routing problem (Q2099500) (← links)
- Multi-goal motion planning using traveling salesman problem in belief space (Q2200674) (← links)
- Further results on an abstract model for branching and its application to mixed integer programming (Q2235165) (← links)
- On the facial structure of symmetric and graphical traveling salesman polyhedra (Q2339807) (← links)
- A parallel optimisation approach for the realisation problem in intensity modulated radiotherapy treatment planning (Q2340528) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Decomposition and dynamic cut generation in integer linear programming (Q2490337) (← links)
- The strength of multi-row models (Q2516350) (← links)
- Speeding up IP-based algorithms for constrained quadratic 0-1 optimization (Q2638389) (← links)
- Engineering Branch-and-Cut Algorithms for the Equicut Problem (Q2848989) (← links)
- A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
- (Q5020990) (← links)
- A Hierarchy of Subgraph Projection-Based Semidefinite Relaxations for Some NP-Hard Graph Optimization Problems (Q6160119) (← links)
