Pages that link to "Item:Q3256638"
From MaRDI portal
The following pages link to Outline of an algorithm for integer solutions to linear programs (Q3256638):
Displaying 50 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- A fixed point iterative approach to integer programming and its distributed computation (Q288180) (← links)
- Individuals, populations and fluid approximations: a Petri net based perspective (Q313335) (← links)
- Origin and early evolution of corner polyhedra (Q323202) (← links)
- An algorithm for solving parametric integer program (Q324821) (← links)
- Integer-empty polytopes in the 0/1-cube with maximal Gomory-Chvàtal rank (Q408442) (← links)
- Dominance rules in combinatorial optimization problems (Q421551) (← links)
- A randomized sieving algorithm for approximate integer programming (Q486990) (← links)
- Integer linear programming for the Bayesian network structure learning problem (Q511785) (← links)
- Learning discrete decomposable graphical models via constraint optimization (Q517387) (← links)
- Three enhancements for optimization-based bound tightening (Q522269) (← links)
- Equitable representation and recruitment (Q537577) (← links)
- A survey of the operational use of ILP models (Q537604) (← links)
- On the enumerative nature of Gomory's dual cutting plane method (Q607496) (← links)
- DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
- A survey of dual-feasible and superadditive functions (Q610986) (← links)
- Lower bounds for the Chvàtal-Gomory rank in the 0/1 cube (Q635513) (← links)
- Random half-integral polytopes (Q635514) (← links)
- Lexicography and degeneracy: Can a pure cutting plane algorithm work? (Q647393) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- Influence of the normalization constraint on the integral simplex using decomposition (Q729804) (← links)
- Large-scale 0-1 linear programming on distributed workstations (Q750295) (← links)
- On matroid parity and matching polytopes (Q777400) (← links)
- An implicit branch-and-bound algorithm for mixed-integer linear programming (Q804472) (← links)
- Logic-based modeling and solution of nonlinear discrete/continuous optimization problems (Q817192) (← links)
- Logical processing for integer programming (Q817209) (← links)
- Algorithms to separate \(\{0,\frac{1}{2}\}\)-Chvátal-Gomory cuts (Q834596) (← links)
- Mixed-integer cuts from cyclic groups (Q868450) (← links)
- An efficient bound-and-stopped algorithm for integer linear programs on the objective function hyperplane (Q870164) (← links)
- Optimizing over the first Chvátal closure (Q877190) (← links)
- The mixing-MIR set with divisible capacities (Q930344) (← links)
- The stable set polytope of quasi-line graphs (Q949780) (← links)
- George Dantzig's contributions to integer programming (Q951090) (← links)
- George Dantzig's impact on the theory of computation (Q951091) (← links)
- On the complexity of cutting-plane proofs using split cuts (Q969513) (← links)
- Cutting plane algorithms for \(0-1\) programming based on cardinality cuts (Q976440) (← links)
- A geometric characterization of ``optimality-equivalent'' relaxations (Q1016070) (← links)
- On the Chvátal rank of the pigeonhole principle (Q1029351) (← links)
- Solving the prize-collecting rural postman problem (Q1041930) (← links)
- Hybridizing exact methods and metaheuristics: a taxonomy (Q1042187) (← links)
- Stable sets, corner polyhedra and the Chvàtal closure (Q1043240) (← links)
- A finitely converging cutting plane technique (Q1060961) (← links)
- Cutting planes in combinatorics (Q1068092) (← links)
- Polyhedral proof methods in combinatorial optimization (Q1082268) (← links)
- Solution approaches for highly primal- and dual-degenerate all-integer programming problems (Q1085064) (← links)
- An advanced start algorithm for all-integer programming (Q1086158) (← links)
- A simple strategy for solving a class of 0-1 integer programming models (Q1090232) (← links)
- The mixed cutting plane algorithm for all-integer programming (Q1092815) (← links)
- A polynomial-time solution to Papadimitriou and Steiglitz's ``traps'' (Q1109689) (← links)
- On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
