The following pages link to Integer Programming (Q3191512):
Displaying 50 items.
- Balas formulation for the union of polytopes is optimal (Q2297650) (← links)
- Granularity in nonlinear mixed-integer optimization (Q2302751) (← links)
- Accelerated dynamic programming algorithms for a car resequencing problem in automotive paint shops (Q2307010) (← links)
- On solving two-stage distributionally robust disjunctive programs with a general ambiguity set (Q2312325) (← links)
- ``Facet'' separation with one linear program (Q2330653) (← links)
- A geometric approach to cut-generating functions (Q2349120) (← links)
- Tight bounds on discrete quantitative Helly numbers (Q2360726) (← links)
- Tight MIP formulations for bounded up/down times and interval-dependent start-ups (Q2364487) (← links)
- The structure of the infinite models in integer programming (Q2401145) (← links)
- Extension complexities of Cartesian products involving a pyramid (Q2404613) (← links)
- A note on the 2-circulant inequalities for the MAX-cut problem (Q2417185) (← links)
- A feasible rounding approach for mixed-integer optimization problems (Q2419508) (← links)
- On the NP-hardness of deciding emptiness of the split closure of a rational polytope in the 0,1 hypercube (Q2419579) (← links)
- HYPE: a system of hyperintensional logic (with an application to semantic paradoxes) (Q2421517) (← links)
- Facets of a mixed-integer bilinear covering set with bounds on variables (Q2423814) (← links)
- A note on the Lasserre hierarchy for different formulations of the maximum independent set problem (Q2661585) (← links)
- An approach to the distributionally robust shortest path problem (Q2668652) (← links)
- Stochastic optimization approaches for elective surgery scheduling with downstream capacity constraints: models, challenges, and opportunities (Q2669630) (← links)
- On the complexity of recognizing integrality and total dual integrality of the \(\{0,1/2\}\)-closure (Q2670463) (← links)
- Generalised 2-circulant inequalities for the max-cut problem (Q2670485) (← links)
- On inequalities with bounded coefficients and pitch for the min knapsack polytope (Q2673233) (← links)
- A scaleable projection-based branch-and-cut algorithm for the \(p\)-center problem (Q2673558) (← links)
- Data-driven mixed-integer linear programming-based optimisation for efficient failure detection in large-scale distributed systems (Q2673583) (← links)
- On routing and scheduling a fleet of resource-constrained vessels to provide ongoing continuous patrol coverage (Q2673804) (← links)
- Derivation and generation of path-based valid inequalities for transmission expansion planning (Q2673816) (← links)
- Impact of graph structures for QAOA on maxcut (Q2685581) (← links)
- Achieving consistency with cutting planes (Q2687054) (← links)
- Lower bounds on the size of general branch-and-bound trees (Q2687056) (← links)
- Towards improving Christofides algorithm on fundamental classes by gluing convex combinations of tours (Q2687058) (← links)
- A polyhedral study of lifted multicuts (Q2688466) (← links)
- Two-halfspace closure (Q2689824) (← links)
- Computational aspects of relaxation complexity: possibilities and limitations (Q2689831) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Maximal $S$-Free Convex Sets and the Helly Number (Q2835843) (← links)
- Another pedagogy for pure-integer Gomory (Q2969967) (← links)
- Helly’s theorem: New variations and applications (Q2979647) (← links)
- Polyhedral approaches to learning Bayesian networks (Q2979652) (← links)
- Delta Minors, Delta Free Clutters, and Entanglement (Q3177442) (← links)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
- Deciding Emptiness of the Gomory-Chvátal Closure is NP-Complete, Even for a Rational Polyhedron Containing No Integer Point (Q3186518) (← links)
- Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns (Q3296267) (← links)
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP (Q3386761) (← links)
- The RaPID-Ω system: Room and proctor intelligent decider for large scale tests programming (Q3388941) (← links)
- Lehman's Theorem and the Directed Steiner Tree Problem (Q3462549) (← links)
- Decomposition Algorithms for Two-Stage Distributionally Robust Mixed Binary Programs (Q4586174) (← links)
- Numerically Safe Lower Bounds for the Capacitated Vehicle Routing Problem (Q4599322) (← links)
- Extension Complexity of Independent Set Polytopes (Q4606697) (← links)
- Can Cut-Generating Functions Be Good and Efficient? (Q4634102) (← links)
- Approximation of Corner Polyhedra with Families of Intersection Cuts (Q4637498) (← links)
- Lower Bounds on the Lattice-Free Rank for Packing and Covering Integer Programs (Q4646443) (← links)
