The following pages link to (Q5465123):
Displaying 32 items.
- Light on the infinite group relaxation. I: Foundations and taxonomy (Q262442) (← links)
- Characterization of the split closure via geometric lifting (Q319191) (← links)
- Branching on general disjunctions (Q543420) (← links)
- Exact and heuristic algorithms for the interval data robust assignment problem (Q632649) (← links)
- Combinatorial integral approximation (Q634784) (← links)
- Integer-programming software systems (Q817202) (← links)
- Lifting inequalities: a framework for generating strong cuts for nonlinear programs (Q847822) (← links)
- Valid inequalities for mixed integer linear programs (Q995784) (← links)
- Valid inequalities for mips and group polyhedra from approximate liftings (Q1016121) (← links)
- Decomposition, reformulation, and diving in university course timetabling (Q1038298) (← links)
- Split closure and intersection cuts (Q1774172) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- Split cuts and extended formulations for mixed integer conic quadratic programming (Q1785310) (← links)
- Computational aspects of infeasibility analysis in mixed integer programming (Q2063195) (← links)
- Outer approximation for mixed-integer nonlinear robust optimization (Q2095574) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- Two-row and two-column mixed-integer presolve using hashing-based pairing methods (Q2219510) (← links)
- Convex hull of two quadratic or a conic quadratic and a quadratic inequality (Q2364498) (← links)
- On optimizing over lift-and-project closures (Q2392660) (← links)
- Local cuts for mixed-integer programming (Q2392934) (← links)
- A 3-slope theorem for the infinite relaxation in the plane (Q2434989) (← links)
- Measuring the impact of primal heuristics (Q2450740) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization (Q2687063) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Presolve Reductions in Mixed Integer Programming (Q3386778) (← links)
- Graphs and Algorithms in Communication Networks on Seven League Boots (Q3404458) (← links)
- Optimal Cutting Planes from the Group Relaxations (Q5108238) (← links)
- Intersection cuts for nonlinear integer programming: convexification techniques for structured sets (Q5962729) (← links)
- Progress in mathematical programming solvers from 2001 to 2020 (Q6114935) (← links)
- Complexity of optimizing over the integers (Q6160281) (← links)
- Damage modeling and detection for a tree network using fractional-order calculus (Q6168785) (← links)
- Development of a heuristic based mixed integer linear programming model for resources allocation during cyberfraud mitigation (Q6200799) (← links)
