The Dual of Integer Linear Programs

The Dual of Integer Linear Programs (2001)

Cached

Download Links

[www.cs.chalmers.se]

by Tuomo K. Takkula

BibTeX

@MISC{Takkula01thedual,
    author = {Tuomo K. Takkula},
    title = {The Dual of Integer Linear Programs },
    year = {2001}
}

Bookmark

OpenURL

Abstract

Citations

7321	Introduction to Algorithms - Cormen, Leiserson, et al. - 2001
2333	Convex Analysis - Rockafellar - 1970
2172	The design and analysis of computer algorithms - Aho, Hopcroft, et al. - 1974
1567	Randomized Algorithms - Motwani, Raghavan - 1995
1232	Theory of Linear and Integer Programming - SCHRIJVER - 1986
969	Geometric Algorithms and Combinatorial Optimization - Grötschel, Lovász, et al. - 1993
863	Integer and combinatorial optimization - Wolsey, Nemhauser - 1999
842	Linear and nonlinear programming - Luenberger - 1984
675	Optimization and Nonsmooth Analysis - Clarke - 1983
638	Linear Programming and Extensions - Dantzig - 1963
554	Nonlinear Programming. Athena Scientific - Bertsekas - 1995
500	Approximation Algorithms for NP--hard Problems - Hochbaum - 1997
192	Minimization Methods for Non-differentiable Functions - Shor - 1985
182	The Lagrangian relaxation method for solving integer programming problems - Fisher - 1981
168	Linear programming in linear time when the dimension is fixed - Megiddo - 1984
148	A subexponential bound for linear programming, Algorithmica 16 - Matouˇsek, Sharir, et al. - 1996
141	The Traveling Salesman Problem and Minimum Spanning Trees - Held, Karp - 2005
138	How good is the simplex algorithm - Klee, Minty - 1969
118	Generalized Lagrange multiplier method for solving problems of optimum allocation of resources - Everett - 1963
111	A new algorithm for minimizing convex functions over convex sets - Vaidya - 1996
106	A polynomial-time algorithm, based on newton’s method, for linear programming - Renegar - 1988
106	Linear programming: Foundations and extensions - Vanderbei - 1997
100	A polynomial algorithm for linear programming - Khachian - 1979
93	A version of the bundle idea for minimizing a nonsmooth function: conceptual idea, convergence analysis, numerical results - Schramm, Zowe - 1992
79	Validation of subgradient optimization - Held, Wolfe, et al. - 1974
59	The Volume Algorithm: Producing primal solutions with a subgradient method - Barahona, Anbil
57	Algorithms for the set covering problem - Caprara, Toth, et al. - 2000
57	Methods of descent for nondifferentiable optimization - Kiwiel - 1985
53	The cutting-plane method for solving convex programs - Kelley - 1960
48	P: A Heuristic Method for the Set Covering Problem - Caprara, Fischetti, et al. - 1999
42	The Simplex Method: A Probabilistic Analysis, volume 1 of Algorithms and Combinatorics - Borgwardt - 1987
38	Convex nondifferentiable optimization: A survey focused on the analytic center cutting plane method’, Optimization Methods and - Goffin, Vial - 2002
36	Y.: New variants of bundle methods - Lemaréchal, Nemirovskii, et al. - 1995
35	Recovery of primal solutions when using subgradient optimization methods to solve Lagrangian duals of linear programs - Sherali, Choi - 1996
33	Convergence rate of incremental subgradient algorithms,” in Stochastic Optimization: Algorithms and Applications - Nedić, Bertsekas - 2000
32	An algorithm for large scale 0-1 integer programming with application to airline crew scheduling - Wedelin - 1995
31	Characterization of the subdifferentials of convex functions - Rockafellar - 1966
30	Convex Analysis and Minimization Algorithms II: Advanced Theory and Bundle Methods - Hiriart-Urruty, Lemaréchal - 1993
30	A polynomial method of approximate centers for linear programming - Roos, Vial - 1992
29	Introduction to minimax - Demyanov, Malazemov - 1990
28	Nondifferentiable optimization and polynomial problems - Shor - 1998
27	Finite Algorithms in Optimization and Data Analysis - Osborne - 1985
26	A lagrangian-based heuristic of large-scale set covering problems - Ceria, Nobili, et al. - 1998
26	Convex Analysis and Minimization Algorithms I: Fundamentals - HIRIART-URRUTY, C - 1993
25	An aggregate subgradient method for nonsmooth convex minimization - Kiwiel - 1983
24	A general method of solving extremum problems. Soviet Mathematics Doklady - Polyak - 1967
24	The theory of subgradients and its application to problems of optimization: convex and nonconvex functions, Heldermann - Rockafellar
23	Bundle methods in nonsmooth optimization - Lemarechal - 1977
22	Algorithms for Railway Crew Management - Caprara, Toth, et al. - 1997
22	A new polynomial-time algorithm for linear programming - Karmakar - 1984