Pages that link to "Item:Q5952319"
From MaRDI portal
The following pages link to On disjunctive cuts for combinatorial optimization (Q5952319):
Displaying 34 items.
- Tightening simple mixed-integer sets with guaranteed bounds (Q431027) (← links)
- Intersection cuts from multiple rows: a disjunctive programming approach (Q458123) (← links)
- Reflections on generating (disjunctive) cuts (Q458126) (← links)
- On the separation of disjunctive cuts (Q543404) (← links)
- Projection, lifting and extended formulation integer and combinatorial optimization (Q817203) (← links)
- Computing deep facet-defining disjunctive cuts for mixed-integer programming (Q847850) (← links)
- A disjunctive cutting plane algorithm for the extreme point mathematical programming problem (Q1058456) (← links)
- The matching relaxation for a class of generalized set partitioning problems (Q1634772) (← links)
- Constraint qualification failure in action (Q1694785) (← links)
- A two-level graph partitioning problem arising in mobile wireless communications (Q1744904) (← links)
- Projection results for the \(k\)-partition problem (Q1751250) (← links)
- Combinatorial optimization and small polytopes (Q1814809) (← links)
- Facets from gadgets (Q2220662) (← links)
- On cutting planes for cardinality-constrained linear programs (Q2330656) (← links)
- A new separation algorithm for the Boolean quadric and cut polytopes (Q2339832) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- Coordinated cutting plane generation via multi-objective separation (Q2436641) (← links)
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems (Q2457618) (← links)
- Disjunctive cuts for continuous linear bilevel programming (Q2463829) (← links)
- A convex-analysis perspective on disjunctive cuts (Q2492679) (← links)
- Note on: N. E. Aguilera, M. S. Escalante, G. L. Nasini, ``The disjunctive procedure and blocker duality'' (Q2565860) (← links)
- Approximate fixed-rank closures of covering problems (Q2583148) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables (Q2775776) (← links)
- Disjunctive Cuts for Nonconvex MINLP (Q2897296) (← links)
- Local Cuts and Two-Period Convex Hull Closures for Big-Bucket Lot-Sizing Problems (Q2960369) (← links)
- (Q3325466) (← links)
- Technical Note—On Generating Cutting Planes from Combinatorial Disjunctions (Q3703585) (← links)
- (Q4537754) (← links)
- (Q5075808) (← links)
- A Repeated Route-then-Schedule Approach to Coordinated Vehicle Platooning: Algorithms, Valid Inequalities and Computation (Q5106379) (← links)
- Target Cuts from Relaxed Decision Diagrams (Q5138261) (← links)
- A note on characterizing canonical cuts using geometry (Q5449873) (← links)
- Easy and hard separation of sparse and dense odd-set constraints in matching (Q6670496) (← links)