Vijay Chandru, M.R. Rao  Home/Search
Context
Related
| upenn.edu/~chandru/ip.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: upenn.edu/~chandru/homepage (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Integer programming is an expressive framework for modeling and solving discrete optimization problems that arise in a variety of contexts in the engineering sciences. Integer programming representations work with implicit algebraic constraints (linear equations and inequalities on integer valued variables) to capture the feasible set of alternatives, and linear objective functions (to minimize or maximize over the feasible set) that specify the criterion for defining optimality. This... (Update)
Active bibliography (related documents): More All
1.8: Linear Programming - Chandru, Atallah (1998) (Correct)
1.4: Practical Problem Solving with Cutting Plane Algorithms.. - Jünger, Reinelt, Thienel (1994) (Correct)
1.0: Balanced Matrices - Conforti, Cornuéjols (2001) (Correct)
Similar documents based on text: More All
0.6: Algorithms for the Optimal Loading of Recursive Neural.. - Chandru, Dattasharma.. (1995) (Correct)
0.5: Commit Processing in Distributed Secure and Real-Time Transaction .. - Nagaraj (1998) (Correct)
0.5: Volume Sculpting and Keyframe Animation System - Chandru, Mahesh, Manivannan.. (2000) (Correct)
BibTeX entry: (Update)
@incollection{ chandru99integer,
author = "Chandru and Rao",
title = "Integer Programming",
booktitle = "Algorithms and Theory of Computation Handbook, {CRC} Press, 1999",
year = "1999",
url = "citeseer.ist.psu.edu/chandru98integer.html" }
Citations (may not include all citations):717 Theory of Linear and Integer Programming (context) - Schrijver - 1986
518 Integer and Combinatorial Optimization (context) - Nemhauser, Wolsey - 1988
482 Combinatorial Optimization: Algorithms and Complexity (context) - Papadimitriou, Steiglitz - 1982
448 A New Polynomial-Time Algorithm for Linear Programming (context) - Karmarkar - 1984
403 Proof verification and hardness of approximation problems - Arora, Lund et al. - 1992
333 Geometric Algorithms and Combinatorial Optimization (context) - Grotschel, Lov'asz et al. - 1988
230 Interior point methods in semidefinite programming with appl.. - Alizadeh - 1995
227 Factoring Polynomials with Rational Coefficients (context) - Lenstra, Jr et al. - 1982
219 and complexity classes (context) - Papadimitriou, Yannakakis et al. - 1991
218 AMPL: A Modeling Language for Mathematical Programming (context) - Fourer, Gay et al. - 1993
186 Randomized rounding: a technique for provably good algorithm.. (context) - Raghavan, Thompson
151 algorithms and applications (context) - Ahuja, Magnati et al. - 1993
117 The ellipsoid method and its consequences in Combinatorial o.. (context) - Grotschel, Lov'asz et al. - 1982
106 approximation algorithms MAX CUT and MAX 2SAT (context) - Goemans, Williamson - 1994
105 A branch and cut algorithm for the resolution of large scale.. (context) - Padberg, Rinaldi - 1991
100 Integer Programming with a Fixed Number of Variables (context) - Jr - 1983
98 A random polynomial time algorithm for approximating the vol.. - Dyer, Frieze et al. - 1989
84 Partitioning procedures for solving mixed-variables programm.. (context) - Benders - 1962
74 Multi-terminal network flows (context) - Gomory, Hu - 1961
66 Decompositions of regular matroids (context) - Seymour - 1980
60 IEEE Transactions on Information Theory (context) - Lov'asz, Shannon et al. - 1979
53 Integer Programming (context) - Garfinkel, Nemhauser - 1972
50 Polynomial algorithms for computing the Smith and Hermite no.. (context) - Kannan, Bachem - 1979
49 Minkowski's convex body theorem and integer programming (context) - Kannan - 1987
48 Odd minimum cut-sets and b-matching (context) - Padberg, Rao - 1982
45 Validation of Subgradient Optimization (context) - Held, Wolfe et al. - 1974
44 Outline of an algorithm for integer solutions to linear prog.. (context) - Gomory - 1958
42 Edmonds polytopes and a hierarchy of combinatorial problems (context) - Chv'atal - 1973
42 A min-max relation for submodular functions on graphs (context) - Edmonds, Giles - 1977
40 Hermite normal form computation using modulo determinant ari.. (context) - Domich, Kannan et al. - 1987
38 Perfect zero-one matrices (context) - Padberg - 1974
37 Discrete Optimization (context) - Parker, Rardin - 1988
36 An introduction to the geometry of numbers (context) - Cassels - 1971
34 Computing near-optimal solutions to combinatorial optimizati.. - Shmoys - 1995
33 the complexity of computing the volume of a polyhedron (context) - Dyer, Frieze - 1988
33 A Polynomial-time Algorithm for Breaking the Basic Merkle-He.. (context) - Shamir - 1982
32 Computationally related problems (context) - Sahni - 1974
31 Branching rules for satisfiability - Hooker, Vinay - 1995
28 Extended Horn sets in propositional logic (context) - Chandru, Hooker - 1991
28 Optimization Methods for Logical Inference (context) - Chandru, Hooker - 1998
27 matroids and certain polyhedra (context) - Edmonds, functions - 1970
25 Expressing Combinatorial optimization problems by linear pro.. (context) - Yannakakis - 1988
24 Integral boundary points of convex polyhedra (context) - Hoffman, Kruskal - 1956
23 Matroids and the greedy algorithm (context) - Edmonds - 1971
22 Normal hypergraphs and the perfect graph conjecture (context) - Lov'asz - 1972
22 Properties of vertex packing and independence system polyhed.. (context) - Nemhauser, Trotter - 1974
21 Practical problem solving with cutting plane algorithms (context) - Junger, Reinelt et al. - 1995
21 An interior-point approach to NP-complete problems - Part (context) - Karmarkar - 1990
21 Cones of matrices and set functions (context) - Lov'asz, Schrijver - 1991
20 On Linear Characterizations of Combinatorial Optimization Pr.. (context) - Karp, Papadimitriou - 1982
20 Matching well solved class of integer linear programs (context) - Edmonds, Johnson - 1970
20 On certain polytopes associated with graphs (context) - Chvatal - 1975
18 Alpha-balanced graphs and matrices and GF (context) - Truemper - 1992
17 A selection problem of shared fixed costs and network flows (context) - Rhys - 1970
16 Polyhedral Combinatorics (context) - Pulleyblank - 1989
16 Worst-case complexity bounds for algorithms in the theory of.. (context) - Lagarias - 1980
15 Principles and Practice of Constraint Programming (context) - Saraswat, Van Hentenryck - 1995
15 Linear and integer programming applied to the propositional .. (context) - Williams - 1987
13 Polynomial-time algorithms in the theory of linear diophenti.. (context) - Frumkin - 1977
13 Logic-Based Decision Support: Mixed Integer Model Formulatio.. (context) - Jeroslow - 1989
13 A Polynomial algorithm for the Two-variable Integer programm.. (context) - Kannan - 1980
13 Lehman's forbidden minor characterization of ideal (context) - Padberg - 1993
12 Testing membership in matroid polyhedra (context) - Cunningham - 1984
12 Annals of Discrete Mathematics (context) - Padberg, packing et al. - 1979
11 Balanced Matrices - Conforti, Cornuejols et al. - 1994
10 Annals of Discrete Mathematics (context) - Edmonds, intersection - 1979
10 Minimum cuts and related problems (context) - Picard, Ratliff - 1975
10 Characterization of totally unimodular matrices (context) - Camion - 1965
9 the relation between integer and noninteger solutions to lin.. (context) - Gomory - 1965
9 A Survey of Lagrangean Techniques for Discrete Optimization (context) - Shapiro - 1979
8 Convergence Rate of the Gradient Descent Method with Dilatio.. (context) - Shor - 1970
8 Sur certains hypergraphes generalisant les graphes bipartite.. (context) - Berge - 1970
8 Maximum matching and a polyhedron with 0-1 vertices (context) - Edmonds - 1965
8 translated into English in Soviet Mathematics Doklady (context) - Khachiyan, algorithm et al. - 1979
7 A fast algorithm for the two-variable integer programming pr.. (context) - Feit - 1984
7 Principles and Practice of Constraint Programming (context) - Borning - 1994
7 Mathematical Programming Study (context) - Fulkerson, Hoffman et al. - 1974
7 the CPLEX callable Library and CPLEX mixed integer library, .. (context) - Using - 1993
6 the computational complexity of integer programming problems (context) - Kannan, Monma - 1978
6 Knapsack public key cryptosystems and diophantine approximat.. (context) - Lagarias - 1983
6 Balanced matrices (context) - Berge - 1972
6 Using separation algorithms to generate mixed integer model .. (context) - Martin - 1991
6 Reducibilities among combinatorial problems (context) - Karp - 1972
5 Computing the volume is difficult (context) - Barany, Furedi - 1986
5 Matroid intersection algorithms (context) - Lawler - 1975
5 Rado's theorem for polymatroids (context) - McDiarmid - 1975
4 Mathematical Programming Studies (context) - Jeroslow, Lowe et al. - 1984
3 A Fourier-f'ele mechanikai elv alkalmaz'asai (context) - Farkas
3 Solving large scale 0-1 linear programming problems (context) - Crowder, Johnson et al. - 1983
3 A class of logical inference problems solvable by linear pro.. (context) - Conforti, Cornuejols - 1992
3 Large-scale zero-one linear programming on distributed works.. (context) - Cannon, Hoffman - 1990
3 The Russian method for linear inequalities (context) - Padberg, Rao - 1981
2 Operations Research Letters (context) - Savelsbergh, Sigosmondi et al. - 1994
2 Lattices and the Basis Reduction Algorithm (context) - Bachem, Kannan - 1984
2 Testing balancedness and perfection of linear matrices (context) - Conforti, Rao - 1993
2 The perfect graph conjecture and the pluperfect graph theore.. (context) - Fulkerson - 1970
2 Research notes in Mathematics (context) - Akgul, Relaxation et al. - 1984
2 Early integer programming (context) - Gomory - 1991
1 Complexity of the supergroup approach to integer programming (context) - Chandru - 1982
1 Experiments in the Formulation of Integer Programming Proble.. (context) - Williams - 1974
1 Perfect 0, \Sigma1 matrices (context) - Conforti, Cornuejols et al. - 1993
1 Balanced 0,\Sigma1 matrices (context) - Conforti, Cornuejols et al. - 1994
1 Linear integer inequalities are NP-complete (context) - Gathen, Sieveking - 1976
1 counting integral points in polyhedra when the dimension is .. (context) - Barvinok, volume - 1993
1 Decomposition of balanced 0,1 matrices (context) - Conforti, Cornuejols et al. - 1991
1 Bounds on positive solutions of linear diophantine equations (context) - Borosh, Treybig - 1976
1 Farbung von Graphen deren samtliche bzw. deren ungerade Krei.. (context) - Berge - 1961
1 Resolution and the integrality of satisfiability polytopes (context) - Hooker - 1992
1 Towards and empirical science of algorithms (context) - Hooker - 1993
1 Finding cuts in large TSP's (context) - Applegate, Bixby et al. - 1994
1 There cannot be any algorithm for integer programming with q.. (context) - Jeroslow - 1973
1 Integer Programming and Cryptography (context) - Jr - 1984
1 A weighted matroid intersection theorem (context) - Frank - 1981
1 A polynomial recognition algorithm for K 4 n e-free perfect .. (context) - Fonlupt, Zemirline - 1981
1 Ideal 0,1 matrices (context) - Cornuejols, Novick - 1994
1 Equivalent knapsack-type formulations of bounded integer lin.. (context) - Padberg - 1972
1 11 Other Sources JOURNALS: Research publications in integer .. (context) - Ziegler, Polytopes et al. - 1995
1 Experiments in quadratic 0 \Gamma 1 programming (context) - Barahona, Junger et al. - 1989
1 Solving Steiner tree problems by Branch and Cut (context) - Chopra, Gorres et al. - 1992
1 Sur un theoreme du type Konig pour hypergraphes (context) - Berge, Las - 1970
Documents on the same site (http://www.seas.upenn.edu/~chandru/homepage.html):
Linear Programming - Chandru, Atallah (1998) (Correct)
Volume Sculpting and Keyframe Animation System - Chandru, Mahesh, Manivannan.. (2000) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC