Pages that link to "Item:Q798260"

The following pages link to Constructive characterizations of the value-function of a mixed-integer program. I (Q798260):

Displaying 15 items.

• The value function of an infinite-horizon single-item lot-sizing problem (Q433828) (← links)
• Chvátal closures for mixed integer programming problems (Q922950) (← links)
• Constructive characterizations of the value function of a mixed-integer program. II (Q1062914) (← links)
• On the Glivenko-Cantelli problem in stochastic programming: mixed-integer linear recourse. (Q1298755) (← links)
• Inference flexibility in Horn clause knowledge bases and the simplex method (Q1319393) (← links)
• Optimality certificates for convex minimization and Helly numbers (Q1728383) (← links)
• Future paths for integer programming and links to artificial intelligence (Q1821034) (← links)
• A closed-form representation of mixed-integer program value functions (Q1914070) (← links)
• A framework for generalized Benders' decomposition and its application to multilevel optimization (Q2097644) (← links)
• Lattice-free simplices with lattice width \(2d - o(d)\) (Q2164720) (← links)
• Parametric methods in integer linear programming (Q2639777) (← links)
• (Q3585635) (← links)
• A Unified Framework for Multistage Mixed Integer Linear Optimization (Q5014640) (← links)
• Solving Stochastic and Bilevel Mixed-Integer Programs via a Generalized Value Function (Q5129216) (← links)
• Evaluating mixed-integer programming models over multiple right-hand sides (Q6047695) (← links)