Pages that link to "Item:Q4044365"
From MaRDI portal
The following pages link to On the existence of optimal solutions to integer and mixed-integer programming problems (Q4044365):
Displaying 50 items.
- Obtaining lower bounds from the progressive hedging algorithm for stochastic mixed-integer programs (Q291039) (← links)
- Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: bounds and solution strategies (Q342075) (← links)
- Some properties of convex hulls of integer points contained in general convex sets (Q378131) (← links)
- A probabilistic comparison of the strength of split, triangle, and quadrilateral cuts (Q433114) (← links)
- Irreducible infeasible sets in convex mixed-integer programs (Q495724) (← links)
- Exact augmented Lagrangian duality for mixed integer linear programming (Q507329) (← links)
- Modeling disjunctive constraints with a logarithmic number of binary variables and constraints (Q543399) (← links)
- On the relative strength of split, triangle and quadrilateral cuts (Q623365) (← links)
- On convergence in mixed integer programming (Q715071) (← links)
- Two-stage robust mixed integer programming problem with objective uncertainty (Q723485) (← links)
- Constructive characterizations of the value-function of a mixed-integer program. I (Q798260) (← links)
- Constructive characterizations of the value function of a mixed-integer program. II (Q1062914) (← links)
- Representability in mixed integer programming. I: Characterization results (Q1089258) (← links)
- The b-hull of an integer program (Q1151337) (← links)
- A characterization of minimal valid inequalities for mixed integer programs (Q1165157) (← links)
- Strong duality for a special class of integer programs (Q1229802) (← links)
- Integer programming formulation of combinatorial optimization problems (Q1239086) (← links)
- The value function of a mixed integer program: I (Q1241180) (← links)
- Cutting-plane theory: Algebraic methods (Q1257827) (← links)
- The value function of a mixed integer program. II (Q1258688) (← links)
- Two mixed integer programming formulations arising in manufacturing management (Q1262212) (← links)
- Certificates of optimality for mixed integer linear programming using generalized subadditive generator functions (Q1748494) (← links)
- Integer programming as projection (Q1751196) (← links)
- On approximation algorithms for concave mixed-integer quadratic programming (Q1800986) (← links)
- On quantile cuts and their closure for chance constrained optimization problems (Q1801023) (← links)
- Representability of functions (Q1825755) (← links)
- A closed-form representation of mixed-integer program value functions (Q1914070) (← links)
- On the complexity of surrogate and group relaxation for integer linear programs (Q2060595) (← links)
- Stochastic Lipschitz dynamic programming (Q2118094) (← links)
- On a generalization of the Chvátal-Gomory closure (Q2118122) (← links)
- On disks of the triangular grid: an application of optimization theory in discrete geometry (Q2185738) (← links)
- Lattice closures of polyhedra (Q2188243) (← links)
- Generating valid linear inequalities for nonlinear programs via sums of squares (Q2198537) (← links)
- Generalized Chvátal-Gomory closures for integer programs with bounds on variables (Q2235152) (← links)
- The strength of multi-row aggregation cuts for sign-pattern integer programs (Q2294249) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- On the relative strength of families of intersection cuts arising from pairs of tableau constraints in mixed integer programs (Q2340339) (← links)
- On the facets of mixed integer programs with two integer variables and two constraints (Q2390999) (← links)
- The structure of the infinite models in integer programming (Q2401145) (← links)
- When the Gomory-chvátal closure coincides with the integer hull (Q2417111) (← links)
- Integer packing sets form a well-quasi-ordering (Q2661623) (← links)
- Mixed Integer Linear Programming Formulation Techniques (Q2808240) (← links)
- Cut-Generating Functions for Integer Variables (Q2833108) (← links)
- A solution method for a knapsack problem and its variant (Q3028724) (← links)
- On Approximation Algorithms for Concave Mixed-Integer Quadratic Programming (Q3186487) (← links)
- Closedness of Integer Hulls of Simple Conic Sets (Q3462546) (← links)
- Integer programming duality: Price functions and sensitivity analysis (Q3908768) (← links)
- The value function of an integer program (Q3941194) (← links)
- On abstract duality in mathematical programming (Q3958298) (← links)
- (Q4133407) (← links)