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):
Displayed 50 items.
- On the relation between the extended supporting hyperplane algorithm and Kelley's cutting plane algorithm (Q2200088) (← links)
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables (Q2235152) (← links)
- Ising formulations of some graph-theoretic problems in psychological research: models and methods (Q2244634) (← links)
- Design and verify: a new scheme for generating cutting-planes (Q2248750) (← links)
- On the Chvátal-Gomory closure of a compact convex set (Q2248755) (← links)
- Lattice-free sets, multi-branch split disjunctions, and mixed-integer programming (Q2248762) (← links)
- Tactical optimization of the oil palm agribusiness supply chain (Q2285344) (← links)
- Improving set partitioning problem solutions by zooming around an improving direction (Q2288990) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- Cutting to the chase. (Q2351157) (← links)
- Redundant robust topology optimization of truss (Q2357836) (← links)
- MIPping closures: An instant survey (Q2373443) (← links)
- Vašek Chvátal: a very short introduction (on the occasion of his 60th birthday) (Q2373937) (← links)
- Convex analysis in groups and semigroups: a sampler (Q2413078) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- Decomposition algorithms with parametric Gomory cuts for two-stage stochastic integer programs (Q2452371) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Solving 0-1 programming problems by a penalty approach. (Q2468556) (← links)
- Projected Chvátal-Gomory cuts for mixed integer linear programs (Q2476991) (← links)
- A constraint generation algorithm for large scale linear programs using multiple-points separation (Q2492707) (← links)
- Edmonds polytopes and a hierarchy of combinatorial problems. (Reprint) (Q2497988) (← links)
- Theory of majority decision elements (Q2539620) (← links)
- A duality theorem and an algorithm for (mixed-) integer nonlinear programming (Q2548914) (← links)
- An outline of linear programming (Q2555451) (← links)
- Gomory cuts revisited (Q2564234) (← links)
- The allocation of shared fixed costs (Q2572246) (← links)
- An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs (Q2643148) (← links)
- Chvátal-Gomory cuts for the Steiner tree problem (Q2659072) (← links)
- On the tree augmentation problem (Q2659770) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- Integer feasibility and refutations in UTVPI constraints using bit-scaling (Q2684489) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Two-halfspace closure (Q2689824) (← links)
- The Cutting Plane Method is Polynomial for Perfect Matchings (Q2800362) (← links)
- Strengthening Chvátal-Gomory Cuts for the Stable Set Problem (Q2835677) (← links)
- Rank of random half-integral polytopes — extended abstract — (Q2883588) (← links)
- Algorithms and Software for Convex Mixed Integer Nonlinear Programs (Q2897292) (← links)
- Solving Nonlinear Integer Arithmetic with MCSAT (Q2961575) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- On the Chvátal rank of linear relaxations of the stable set polytope (Q3002564) (← links)
- A note on the Chvátal-rank of clique family inequalities (Q3004203) (← links)
- On the Chvátal-Gomory Closure of a Compact Convex Set (Q3009756) (← links)
- Design and Verify: A New Scheme for Generating Cutting-Planes (Q3009757) (← links)
- Men and progress in linear programming (Q3089104) (← links)
- Valid inequalities, cutting planes and integrality of the knapsack polytope (Q3101539) (← links)
- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (Q3186518) (← links)
- Matrices of rational integers (Q3277523) (← links)
- Gemischt ganzzahlige lineare Programme zur Lösung gewisser Entscheidungsprobleme (Q3284266) (← links)
- Bemerkungen zum Verfahren vonGomory zur Bestimmung ganzzahliger Lösungen von linearen Programmen (Q3288562) (← links)