Pages that link to "Item:Q995784"

The following pages link to Valid inequalities for mixed integer linear programs (Q995784):

Displaying 47 items.

• Improving branch-and-cut performance by random sampling (Q266414) (← links)
• Integrality gaps for strengthened linear relaxations of capacitated facility location (Q304227) (← links)
• Characterization of the split closure via geometric lifting (Q319191) (← links)
• Stage- and scenario-wise Fenchel decomposition for stochastic mixed 0-1 programs with special structure (Q337541) (← links)
• Strong lift-and-project cutting planes for the stable set problem (Q378110) (← links)
• On the membership problem for the \({0, 1/2}\)-closure (Q408382) (← links)
• DRL\(^*\): A hierarchy of strong block-decomposable linear relaxations for 0-1 mips (Q608295) (← links)
• Random half-integral polytopes (Q635514) (← links)
• MIR closures of polyhedral sets (Q847821) (← links)
• Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
• Compact formulations as a union of polyhedra (Q927156) (← links)
• On the polyhedral lift-and-project methods and the fractional stable set polytope (Q1015326) (← links)
• The impact of distribution system characteristics on computational tractability (Q1042484) (← links)
• Solving discrete linear bilevel optimization problems using the optimal value reformulation (Q1675551) (← links)
• Lift-and-project cuts for convex mixed integer nonlinear programs (Q1697971) (← links)
• The dynamic bowser routing problem (Q1711454) (← links)
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning (Q1751150) (← links)
• A complete characterization of disjunctive conic cuts for mixed integer second order cone optimization (Q1751214) (← links)
• General cut-generating procedures for the stable set polytope (Q1752480) (← links)
• Preprocessing and cut generation techniques for multi-objective binary programming (Q1755381) (← links)
• A relax-and-cut framework for Gomory mixed-integer cuts (Q1762453) (← links)
• A short proof for the polyhedrality of the Chvátal-Gomory closure of a compact convex set (Q1785240) (← links)
• Decomposing the efficient frontier of the DEA production possibility set into a smallest number of convex polyhedrons by mixed integer programming (Q1926834) (← links)
• Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
• A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
• Discrete dynamical system approaches for Boolean polynomial optimization (Q2161551) (← links)
• Bi-objective optimization problems with two decision makers: refining Pareto-optimal front for equilibrium solution (Q2197166) (← links)
• On the facet defining inequalities of the mixed-integer bilinear covering set (Q2216198) (← links)
• Optimizing drinking water distribution system operations (Q2327640) (← links)
• A novel dynamic generalized opposition-based grey wolf optimization algorithm (Q2331450) (← links)
• An iterative graph expansion approach for the scheduling and routing of airplanes (Q2337398) (← links)
• Redundant robust topology optimization of truss (Q2357836) (← links)
• Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
• MIPping closures: An instant survey (Q2373443) (← links)
• On mixing sets arising in chance-constrained programming (Q2429465) (← links)
• A note on the selection of Benders' cuts (Q2638375) (← links)
• A note on the implications of approximate submodularity in discrete optimization (Q2678995) (← links)
• On Minimal Valid Inequalities for Mixed Integer Conic Programs (Q2806815) (← links)
• On the minimum cut separator problem (Q2892143) (← links)
• A Conic Representation of the Convex Hull of Disjunctive Sets and Conic Cuts for Integer Second Order Cone Optimization (Q3462302) (← links)
• Integer programming solution approach for inventory‐production–distribution problems with direct shipments (Q3499436) (← links)
• Decision Diagrams for Discrete Optimization: A Survey of Recent Advances (Q5106421) (← links)
• Lattice Reformulation Cuts (Q5162650) (← links)
• The Gomory-Chvátal Closure of a Non-Rational Polytope is a Rational Polytope (Q5176373) (← links)
• Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
• Continuous cutting plane algorithms in integer programming (Q6047699) (← links)
• Exact methods for discrete \({\varGamma}\)-robust interdiction problems with an application to the bilevel knapsack problem (Q6062886) (← links)