The following pages link to (Q2712822):
Displayed 20 items.
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects (Q817185) (← links)
- Rapid prototyping of optimization algorithms using COIN-OR: a case study involving the cutting-stock problem (Q817190) (← links)
- Logical processing for integer programming (Q817209) (← links)
- ILP approaches to the blockmodel problem (Q856277) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- On the strength of Gomory mixed-integer cuts as group cuts (Q948966) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- On solving the progressive party problem as a MIP. (Q1422363) (← links)
- Exploring relaxation induced neighborhoods to improve MIP solutions (Q1769074) (← links)
- Lagrangian decomposition of block-separable mixed-integer all-quadratic programs (Q1771303) (← links)
- A generalized dual phase-2 simplex algorithm. (Q1811141) (← links)
- A variable neighborhood decomposition search method for supply chain management planning problems (Q2433455) (← links)
- Hyper-sparsity in the revised simplex method and how to exploit it (Q2490370) (← links)
- Solving convex MINLP optimization problems using a sequential cutting plane algorithm (Q2506191) (← links)
- An efficient, adaptive parameter variation scheme for metaheuristics based on the epsilon-constraint method (Q2572861) (← links)
- Valid inequalities based on simple mixed-integer sets (Q2583149) (← links)
- An interior-point approach for primal block-angular problems (Q2643610) (← links)
- Computing with Multi-row Gomory Cuts (Q3503849) (← links)
- Counting Solutions of Integer Programs Using Unrestricted Subtree Detection (Q5387636) (← links)
- Classical cuts for mixed-integer programming and branch-and-cut (Q5896802) (← links)