| Publication | Date of Publication | Type |
|---|
Facets and rank of integer polyhedra
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
The rank of (mixed-) integer polyhedra
Mathematical Programming. Series A. Series B | 2013-03-18 | Paper |
Mixed-integer programming -- 1968 and thereafter
Annals of Operations Research | 2011-05-20 | Paper |
Classical cuts for mixed-integer programming and branch-and-cut
Annals of Operations Research | 2006-03-07 | Paper |
The Finite Sample Breakdown Point of \boldmath\ell₁-Regression
SIAM Journal on Optimization | 2005-02-23 | Paper |
Least trimmed squares regression, least median squares regression, and mathematical program\-ming
Mathematical and Computer Modelling | 2004-08-20 | Paper |
Classical cuts for mixed-integer programming and branch-and-cut
Mathematical Methods of Operations Research | 2003-07-15 | Paper |
Alternative methods of linear regression
Mathematical and Computer Modelling | 2002-08-15 | Paper |
Optimal project selection when borrowing and lending rates differ
Mathematical and Computer Modelling | 2002-05-05 | Paper |
Almost perfect matrices and graphs.
Mathematics of Operations Research | 2001-11-26 | Paper |
Linear optimization and extensions. Problems and solutions
Universitext | 2001-07-12 | Paper |
Approximating separable nonlinear functions via mixed zero-one programs
Operations Research Letters | 2000-12-20 | Paper |
Packing small boxes into a big box.
Mathematical Methods of Operations Research | 2000-01-01 | Paper |
Linear optimization and extensions.
Algorithms and Combinatorics | 1999-07-28 | Paper |
| scientific article; zbMATH DE number 1058043 (Why is no real title available?) | 1997-12-11 | Paper |
An analytic symmetrization of max flow-min cut
Discrete Mathematics | 1997-06-10 | Paper |
Location, scheduling, design and integer programming
International Series in Operations Research & Management Science | 1997-02-16 | Paper |
Linear optimization and extensions
Algorithms and Combinatorics | 1995-06-14 | Paper |
| scientific article; zbMATH DE number 553772 (Why is no real title available?) | 1994-04-19 | Paper |
Solving Airline Crew Scheduling Problems by Branch-and-Cut
Management Science | 1994-03-17 | Paper |
Boolean polynomials and set functions
Mathematical and Computer Modelling | 1994-01-02 | Paper |
Lehman's forbidden minor characterization of ideal 0-1 matrices
Discrete Mathematics | 1993-12-20 | Paper |
Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut
ORSA Journal on Computing | 1993-02-18 | Paper |
An analytical comparison of different formulations of the travelling salesman problem
Mathematical Programming. Series A. Series B | 1992-06-27 | Paper |
A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
SIAM Review | 1991-01-01 | Paper |
Facet identification for the symmetric traveling salesman polytope
Mathematical Programming. Series A. Series B | 1990-01-01 | Paper |
The complexity of matching with bonds
Information Processing Letters | 1989-01-01 | Paper |
The Boolean quadratic polytope: Some characteristics, facets and relatives
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
Total unimodularity and the Euler-subgraph problem
Operations Research Letters | 1988-01-01 | Paper |
Branch-and-cut approach to a variant of the traveling salesman problem
Journal of Guidance, Control, and Dynamics | 1988-01-01 | Paper |
A polynomial-time solution to Papadimitriou and Steiglitz's ``traps''
Operations Research Letters | 1988-01-01 | Paper |
A different convergence proof of the projective method for linear programming
Operations Research Letters | 1986-01-01 | Paper |
| scientific article; zbMATH DE number 3908160 (Why is no real title available?) | 1985-01-01 | Paper |
Valid Linear Inequalities for Fixed Charge Problems
Operations Research | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3943559 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3943560 (Why is no real title available?) | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3898931 (Why is no real title available?) | 1984-01-01 | Paper |
Fractional covers for forests and matchings
Mathematical Programming | 1984-01-01 | Paper |
Solving Large-Scale Zero-One Linear Programming Problems
Operations Research | 1983-01-01 | Paper |
Trees and Cuts
Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics | 1983-01-01 | Paper |
Degree-two Inequalities, Clique Facets, and Biperfect Graphs
North-Holland Mathematics Studies | 1982-01-01 | Paper |
A note on the knapsack problem with special ordered sets
Operations Research Letters | 1981-01-01 | Paper |
Solving Large-Scale Symmetric Travelling Salesman Problems to Optimality
Management Science | 1980-01-01 | Paper |
(1,k)-configurations and facets for packing problems
Mathematical Programming | 1980-01-01 | Paper |
On the symmetric travelling salesman problem: A computational study
Mathematical Programming Studies | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3668315 (Why is no real title available?) | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3643033 (Why is no real title available?) | 1979-01-01 | Paper |
On the symmetric travelling salesman problem I: Inequalities
Mathematical Programming | 1979-01-01 | Paper |
On the symmetric travelling salesman problem II: Lifting theorems and facets
Mathematical Programming | 1979-01-01 | Paper |
Covering, Packing and Knapsack Problems
Discrete Optimization I, Proceedings of the Advanced Research Institute on Discrete Optimization and Systems Applications of the Systems Science Panel of NATO and of the Discrete Optimization Symposium | 1979-01-01 | Paper |
Adjacent vertices of the all 0-1 programming polytope
RAIRO - Operations Research | 1979-01-01 | Paper |
| scientific article; zbMATH DE number 3601414 (Why is no real title available?) | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3648429 (Why is no real title available?) | 1978-01-01 | Paper |
Technical Note—A Note on the Symmetric Multiple Traveling Salesman Problem with Fixed Charges
Operations Research | 1977-01-01 | Paper |
Lineare Charakterisierungen von Travelling Salesman Problemen
Zeitschrift für Operations Research | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3619917 (Why is no real title available?) | 1977-01-01 | Paper |
Set Partitioning: A survey
SIAM Review | 1976-01-01 | Paper |
A note on the total unimodularity of matrices
Discrete Mathematics | 1976-01-01 | Paper |
Almost integral polyhedra related to certain combinatorial optimization problems
Linear Algebra and its Applications | 1976-01-01 | Paper |
Constraint Pairing In Integer Programming
INFOR: Information Systems and Operational Research | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3485516 (Why is no real title available?) | 1975-01-01 | Paper |
Technical Note—A Note on Zero-One Programming
Operations Research | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3495859 (Why is no real title available?) | 1975-01-01 | Paper |
On the Set-Covering Problem: II. An Algorithm for Set Partitioning
Operations Research | 1975-01-01 | Paper |
Partial linear characterizations of the asymmetric travelling salesman polytope
Mathematical Programming | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3492442 (Why is no real title available?) | 1974-01-01 | Paper |
Perfect zero–one matrices
Mathematical Programming | 1974-01-01 | Paper |
The Triangular E-Model of Chance-Constrained Programming with Stochastic A-Matrix
Management Science | 1974-01-01 | Paper |
On the facial structure of set packing polyhedra
Mathematical Programming | 1973-01-01 | Paper |
Equivalent knapsack‐type formulations of bounded integer linear programs: An alternative approach
Naval Research Logistics Quarterly | 1972-01-01 | Paper |
On the Set-Covering Problem
Operations Research | 1972-01-01 | Paper |
A Remark on “an Inequality for the Number of Lattice Points in a Simplex”
SIAM Journal on Applied Mathematics | 1971-01-01 | Paper |
