The following pages link to Integer Programming (Q3191512):
Displaying 50 items.
- A branch and cut heuristic for a runway scheduling problem (Q510289) (← links)
- Public-key cryptosystem based on invariants of diagonalizable groups (Q524643) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Intersection cuts for single row corner relaxations (Q1621696) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Strong valid inequalities for Boolean logical pattern generation (Q1675646) (← links)
- A double oracle approach to minmax regret optimization problems with interval data (Q1683128) (← links)
- An abstract model for branching and its application to mixed integer programming (Q1683695) (← links)
- Another pedagogy for mixed-integer Gomory (Q1688937) (← links)
- Adding incompatibilities to the simple plant location problem: formulation, facets and computational experience (Q1725611) (← links)
- Monoidal cut strengthening and generalized mixed-integer rounding for disjunctions and complementarity constraints (Q1728353) (← links)
- Optimality certificates for convex minimization and Helly numbers (Q1728383) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
- Decomposition methods for the two-stage stochastic Steiner tree problem (Q1744908) (← links)
- A class of valid inequalities for multilinear 0-1 optimization problems (Q1751230) (← links)
- A linear complementarity based characterization of the weighted independence number and the independent domination number in graphs (Q1752600) (← links)
- A new lift-and-project operator (Q1752818) (← links)
- Identification of unidentified equality constraints for integer programming problems (Q1753456) (← links)
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
- Integer programming for urban design (Q1755415) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← links)
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- On the use of intersection cuts for bilevel optimization (Q1800991) (← links)
- Ellipsoidal mixed-integer representability (Q1801008) (← links)
- Cuboids, a class of clutters (Q1985449) (← links)
- Algorithmic expedients for the \(S\)-labeling problem (Q2003435) (← links)
- Outer approximation for integer nonlinear programs via decision diagrams (Q2020602) (← links)
- Facets, weak facets, and extreme functions of the Gomory-Johnson infinite group problem (Q2020605) (← links)
- Exact solution algorithms for the maximum flow problem with additional conflict constraints (Q2023909) (← links)
- Machine learning for combinatorial optimization: a methodological tour d'horizon (Q2029358) (← links)
- Integrating facility layout design and aisle structure in manufacturing systems: formulation and exact solution (Q2029369) (← links)
- Minimax theorems for finite blocklength lossy joint source-channel coding over an arbitrarily varying channel (Q2044125) (← links)
- A geometric branch and bound method for robust maximization of convex functions (Q2052396) (← links)
- A receding horizon event-driven control strategy for intelligent traffic management (Q2058578) (← links)
- Pitch, extension complexity, and covering problems (Q2060545) (← links)
- Probabilistic analysis of algorithms for cost constrained minimum weighted combinatorial objects (Q2060557) (← links)
- Complexity of branch-and-bound and cutting planes in mixed-integer optimization. II (Q2061899) (← links)
- Matroid optimization problems with monotone monomials in the objective (Q2064281) (← links)
- Exact and heuristic algorithms for the maximum weighted submatrix coverage problem (Q2076862) (← links)
- Multi-modal supply chain distribution problem (Q2085483) (← links)
- The aggregation closure is polyhedral for packing and covering integer programs (Q2089800) (← links)
- Sequence independent lifting for a set of submodular maximization problems (Q2097631) (← links)
- A decomposition method for distributionally-robust two-stage stochastic mixed-integer conic programs (Q2097655) (← links)
- A study of data-driven distributionally robust optimization with incomplete joint data under finite support (Q2098046) (← links)
- Characterization of QUBO reformulations for the maximum \(k\)-colorable subgraph problem (Q2107015) (← links)
- Scattered storage assignment: mathematical model and valid inequalities to optimize the intra-order item distances (Q2108111) (← links)
