Pages that link to "Item:Q4363673"

The following pages link to Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework (Q4363673):

Displaying 29 items.

• Exact algorithms based on Benders decomposition for multicommodity uncapacitated fixed-charge network design (Q2273684) (← links)
• Pivot-and-reduce cuts: an approach for improving Gomory mixed-integer cuts (Q2275620) (← links)
• Lift-and-project for general two-term disjunctions (Q2339813) (← links)
• On mathematical programming with indicator constraints (Q2349121) (← links)
• Petroleum supply planning: reformulations and a novel decomposition algorithm (Q2358145) (← links)
• Problems of discrete optimization: challenges and main approaches to solve them (Q2371716) (← links)
• On optimizing over lift-and-project closures (Q2392660) (← links)
• Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
• Exact MAX-2SAT solution via lift-and-project closure (Q2466587) (← links)
• Optimizing over the split closure (Q2476990) (← links)
• Gomory cuts revisited (Q2564234) (← links)
• The \(C^3\) theorem and a \(D^2\) algorithm for large scale stochastic mixed-integer programming: set convexification (Q2570997) (← links)
• Approximate fixed-rank closures of covering problems (Q2583148) (← links)
• A note on the selection of Benders' cuts (Q2638375) (← links)
• Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints (Q2815438) (← links)
• Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
• Lifted tableaux inequalities for \(0\)-\(1\) mixed-integer programs: a computational study (Q2899134) (← links)
• When Lift-and-Project Cuts Are Different (Q3386803) (← links)
• Obtaining Tighter Relaxations of Mathematical Programs with Complementarity Constraints (Q3454970) (← links)
• Two-Stage Stochastic Mixed-Integer Programs: Algorithms and Insights (Q3565463) (← links)
• Subset Coefficient Reduction Cuts for 0/1 Mixed-Integer Programming (Q3706846) (← links)
• (Q4414642) (← links)
• Computational study of a family of mixed-integer quadratic programming problems (Q5101407) (← links)
• Combining and strengthening Gomory cuts (Q5101435) (← links)
• Constraint Integer Programming: A New Approach to Integrate CP and MIP (Q5387617) (← links)
• Branch and cut methods for network optimization (Q5936762) (← links)
• Elementary closures for integer programs. (Q5937498) (← links)
• Disjunctive cuts in mixed-integer conic optimization (Q6038657) (← links)
• Sparse multi-term disjunctive cuts for the epigraph of a function of binary variables (Q6589754) (← links)