Pages that link to "Item:Q3793940"

The following pages link to Sensitivity theorems in integer linear programming (Q3793940):

Displaying 50 items.

• Error bounds for mixed integer linear optimization problems (Q263186) (← links)
• Error bounds for mixed integer nonlinear optimization problems (Q315475) (← links)
• Two-stage quadratic integer programs with stochastic right-hand sides (Q431020) (← links)
• Continuity and stability of fully random two-stage stochastic programs with mixed-integer recourse (Q479216) (← links)
• On the complexity of cutting-plane proofs (Q580175) (← links)
• Two strongly polynomial cut cancelling algorithms for minimum cost network flow (Q689972) (← links)
• Non-standard approaches to integer programming (Q697562) (← links)
• Some proximity and sensitivity results in quadratic integer programming (Q751508) (← links)
• Tightness of sensitivity and proximity bounds for integer linear programs (Q831833) (← links)
• Quantitative stability of fully random mixed-integer two-stage stochastic programs (Q941027) (← links)
• Existence of equilibria in a decentralized two-level supply chain (Q1014973) (← links)
• New pseudopolynomial complexity bounds for the bounded and other integer knapsack related problems (Q1038094) (← links)
• Subspaces with well-scaled frames (Q1122483) (← links)
• On cutting-plane proofs in combinatorial optimization (Q1123134) (← links)
• An algorithm to perform a complete right-hand-side parametrical analysis for a 0-1-integer linear programming problem (Q1124717) (← links)
• The relationship between integer and real solutions of constrained convex programming (Q1176807) (← links)
• The distance to a polyhedron (Q1187387) (← links)
• Lattice translates of a polytope and the Frobenius problem (Q1196686) (← links)
• The sharp Lipschitz constants for feasible and optimal solutions of a perturbed linear program (Q1260956) (← links)
• Standard pairs and group relaxations in integer programming (Q1295785) (← links)
• Error bounds for analytic systems and their applications (Q1340064) (← links)
• Error bounds in mathematical programming (Q1365060) (← links)
• The height of minimal Hilbert bases (Q1378894) (← links)
• Two sensitivity theorems in fuzzy integer programming. (Q1421465) (← links)
• Monotonizing linear programs with up to two nonzeroes per column (Q1433661) (← links)
• On matrices with the Edmonds-Johnson property arising from bidirected graphs (Q1745732) (← links)
• FPT-algorithms for some problems related to integer programming (Q1752617) (← links)
• Refined proximity and sensitivity results in linearly constrained convex separable integer programming (Q1899421) (← links)
• Error estimates and Lipschitz constants for best approximation in continuous function spaces (Q1904181) (← links)
• A closed-form representation of mixed-integer program value functions (Q1914070) (← links)
• A note of Lipschitz constants for solutions of linear inequalities and equations (Q1923226) (← links)
• On the Chvátal rank of polytopes in the 0/1 cube (Q1961231) (← links)
• Strong IP formulations need large coefficients (Q2019425) (← links)
• Inverse integer optimization with multiple observations (Q2039063) (← links)
• Rational polyhedral outer-approximations of the second-order cone (Q2042079) (← links)
• Parametric error bounds for convex approximations of two-stage mixed-integer recourse models with a random second-stage cost vector (Q2084032) (← links)
• Proximity in concave integer quadratic programming (Q2149572) (← links)
• On lattice point counting in \(\varDelta\)-modular polyhedra (Q2162684) (← links)
• Improving the Cook et al. proximity bound given integral valued constraints (Q2164682) (← links)
• On circuit diameter bounds via circuit imbalances (Q2164689) (← links)
• Convex approximations for two-stage mixed-integer mean-risk recourse models with conditional value-at-risk (Q2189450) (← links)
• Distances to lattice points in knapsack polyhedra (Q2191767) (← links)
• Rounding on the standard simplex: regular grids for global optimization (Q2250080) (← links)
• Distances between optimal solutions of mixed-integer programs (Q2288201) (← links)
• Geometric random edge (Q2364496) (← links)
• Parametric methods in integer linear programming (Q2639777) (← links)
• Facet Generating Techniques (Q2971603) (← links)
• Robust Polynomial-Time Approximation Schemes for Parallel Machine Scheduling with Job Arrivals and Departures (Q3186540) (← links)
• Computation, Multiplicity, and Comparative Statics of Cournot Equilibria in Integers (Q3186547) (← links)
• Pseudo-Valid Cutting Planes for Two-Stage Mixed-Integer Stochastic Programs with Right-Hand-Side Uncertainty (Q3387962) (← links)