Pages that link to "Item:Q3696859"
From MaRDI portal
The following pages link to Solving Large-Scale Zero-One Linear Programming Problems (Q3696859):
Displaying 50 items.
- Box-constrained quadratic programs with fixed charge variables (Q933786) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- Multi-step methods for choosing the best set of variables in regression analysis (Q989838) (← links)
- Efficient solutions for special zero-one programming problems (Q995926) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Solving multiple scenarios in a combinatorial auction (Q1017447) (← links)
- A note on solving large p-median problems (Q1060943) (← links)
- Location problems (Q1062596) (← links)
- Valid inequalities for mixed 0-1 programs (Q1076609) (← links)
- Exact methods for the knapsack problem and its generalizations (Q1083032) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- A simple strategy for solving a class of 0-1 integer programming models (Q1090232) (← links)
- Global minimization of indefinite quadratic problems (Q1092620) (← links)
- Adding activities to the dual instead of cuts to the primal problem (Q1097165) (← links)
- Some branch and bound techniques for nonlinear optimization (Q1100098) (← links)
- S3 sets. An extension of the Beale-Tomlin special ordered sets (Q1102852) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- Dual formulations and subgradient optimization strategies for linear programming relaxations of mixed-integer programs (Q1110459) (← links)
- A note on the pivot and complement heuristic for 0-1 programming problems (Q1113801) (← links)
- Strong formulations for mixed integer programming: A survey (Q1121789) (← links)
- Facets and lifting procedures for the set covering polytope (Q1123808) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- A note on the knapsack problem with special ordered sets (Q1168894) (← links)
- Finding minimum cost directed trees with demands and capacities (Q1179742) (← links)
- A characterization of knapsacks with the max-flow--min-cut property (Q1197887) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
- Valid inequalities and facets of the capacitated plant location problem (Q1262820) (← links)
- QUAD01: A data-structured implementation of Hansen's quadratic zero-one programming algorithm (Q1278400) (← links)
- Fixing variables and generating classical cutting planes when using an interior point branch and cut method to solve integer programming problems (Q1278590) (← links)
- Optimizing nuclear power plant refueling with mixed-integer programming (Q1278616) (← links)
- Cutting planes for integer programs with general integer variables (Q1290616) (← links)
- Cutting planes for mixed-integer knapsack polyhedra (Q1290620) (← links)
- A procedure for optimizing tactical response in oil spill clean up operations (Q1290711) (← links)
- Different transformations for solving non-convex trim-loss problems by MINLP (Q1291782) (← links)
- Solving the generalised assignment problem using polyhedral results (Q1296797) (← links)
- Cost optimal allocation of rail passenger lines (Q1303534) (← links)
- The complexity of cover inequality separation (Q1306471) (← links)
- Order selection on a single machine with high set-up costs (Q1309884) (← links)
- A technique for speeding up the solution of the Lagrangean dual (Q1315429) (← links)
- An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem (Q1327230) (← links)
- Obtaining clique, cover and coefficient reduction inequalities as Chvatal-Gomory inequalities and Gomory fractional cuts (Q1328648) (← links)
- Partial cover and complete cover inequalities (Q1331885) (← links)
- A composite branch and bound, cutting plane algorithm for concave minimization over a polyhedron (Q1332814) (← links)
- Solving \(0/1\) integer programs with enumeration cutting planes (Q1339119) (← links)
- Supernode processing of mixed-integer models (Q1342883) (← links)
- Binary integer programs with two variables per inequality (Q1363421) (← links)
- Some properties of cliques in 0-1 mixed integer programs (Q1367871) (← links)
