| Publication | Date of Publication | Type |
|---|
When Lift-and-Project Cuts Are Different
INFORMS Journal on Computing | 2021-01-07 | Paper |
Partial hyperplane activation for generalized intersection cuts
Mathematical Programming Computation | 2020-04-29 | Paper |
Implementation of a linear time algorithm for certain generalized traveling salesman problems
Integer Programming and Combinatorial Optimization | 2019-01-11 | Paper |
| Disjunctive programming | 2018-10-02 | Paper |
Erratum to ``Intersection cuts -- standard versus restricted
Discrete Optimization | 2018-08-17 | Paper |
Intersection cuts -- standard versus restricted
Discrete Optimization | 2018-05-24 | Paper |
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts
Mathematical Programming. Series A. Series B | 2016-11-25 | Paper |
Intersection cuts from multiple rows: a disjunctive programming approach
EURO Journal on Computational Optimization | 2014-09-30 | Paper |
Generalized intersection cuts and a new cut generating paradigm
Mathematical Programming. Series A. Series B | 2013-03-18 | Paper |
A hard integer program made easy by lexicography
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Monoidal cut strengthening revisited
Discrete Optimization | 2012-07-12 | Paper |
Linear time dynamic-programming algorithms for new classes of restricted TSPs: a computational study
INFORMS Journal on Computing | 2012-05-30 | Paper |
| scientific article; zbMATH DE number 5999376 (Why is no real title available?) | 2012-01-19 | Paper |
| Will to freedom. A perilous journey through fascism and communism. Transl. from the English | 2012-01-19 | Paper |
Lexicography and degeneracy: Can a pure cutting plane algorithm work?
Mathematical Programming. Series A. Series B | 2011-11-23 | Paper |
Projecting systems of linear inequalities with binary variables
Annals of Operations Research | 2011-11-17 | Paper |
Some thoughts on the development of integer programming during my research career
Annals of Operations Research | 2011-05-20 | Paper |
On the Cycle Polytope of a Directed Graph and Its Relaxations
Operations Research Proceedings | 2011-04-07 | Paper |
On the cycle polytope of a directed graph and its relaxations
Networks | 2010-11-24 | Paper |
On the enumerative nature of Gomory's dual cutting plane method
Mathematical Programming. Series A. Series B | 2010-11-22 | Paper |
Disjunctive Programming
50 Years of Integer Programming 1958-2008 | 2010-06-03 | Paper |
Generating lift-and-project cuts from the LP simplex tableau: open source implementation and testing of new variants
Mathematical Programming Computation | 2009-12-09 | Paper |
Job shop scheduling with setup times, deadlines and precedence constraints
Journal of Scheduling | 2009-08-28 | Paper |
Octane: A New Heuristic for Pure 0–1 Programs
Operations Research | 2009-07-03 | Paper |
Can Pure Cutting Plane Algorithms Work?
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
Optimizing over the split closure
Mathematical Programming. Series A. Series B | 2008-03-12 | Paper |
New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
New facets of the STS polytope generated from known facets of the ATS polytope
Discrete Optimization | 2006-06-30 | Paper |
Projection, lifting and extended formulation integer and combinatorial optimization
Annals of Operations Research | 2006-03-07 | Paper |
Pivot and shift -- a mixed integer programming heuristic
Discrete Optimization | 2005-08-22 | Paper |
The vertex separator problem: a polyhedral investigation
Mathematical Programming. Series A. Series B | 2005-08-08 | Paper |
The vertex separator problem: algorithms and computations
Mathematical Programming. Series A. Series B | 2005-08-08 | Paper |
Logical constraints as cardinality rules: Tight representation
Journal of Combinatorial Optimization | 2005-03-15 | Paper |
| scientific article; zbMATH DE number 2084778 (Why is no real title available?) | 2004-08-09 | Paper |
On unions and dominants of polytopes
Mathematical Programming. Series A. Series B | 2004-07-01 | Paper |
| scientific article; zbMATH DE number 2064417 (Why is no real title available?) | 2004-05-18 | Paper |
| scientific article; zbMATH DE number 2064406 (Why is no real title available?) | 2004-05-18 | Paper |
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
Some thoughts on the development of integer programming during my research career - lecture delivered upon receiving the EURO Gold medal, July 9, 2001, Rotterdam
European Journal of Operational Research | 2002-11-13 | Paper |
Lift-and-project for mixed 0-1 programming: recent progress
Discrete Applied Mathematics | 2002-09-17 | Paper |
| scientific article; zbMATH DE number 1757966 (Why is no real title available?) | 2002-06-20 | Paper |
Guided local search with shifting bottleneck for job shop scheduling
Management Science | 2002-04-17 | Paper |
Lifted cycle inequalities for the asymmetric traveling salesman problem
Mathematics of Operations Research | 2001-11-26 | Paper |
| scientific article; zbMATH DE number 1517142 (Why is no real title available?) | 2000-10-15 | Paper |
Optimized crossover-based genetic algorithms for the maximum cardinality and maximum weight clique problems
Journal of Heuristics | 1999-08-08 | Paper |
New classes of efficiently solvable generalized traveling salesman problems
Annals of Operations Research | 1999-06-10 | Paper |
Disjunctive programming: Properties of the convex hull of feasible points
Discrete Applied Mathematics | 1999-03-22 | Paper |
| scientific article; zbMATH DE number 1263258 (Why is no real title available?) | 1999-03-16 | Paper |
On the dimension of projected polyhedra
Discrete Applied Mathematics | 1998-11-29 | Paper |
Projection with a minimal system of inequalities
Computational Optimization and Applications | 1998-09-20 | Paper |
Recognizing facet defining inequalities
Acta Mathematica Vietnamica | 1998-09-20 | Paper |
A modified lift-and-project procedure
Mathematical Programming. Series A. Series B | 1998-05-25 | Paper |
Job shop scheduling with deadlines
Journal of Combinatorial Optimization | 1998-04-13 | Paper |
On the monotonization of polyhedra
Mathematical Programming. Series A. Series B | 1997-11-25 | Paper |
Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
Management Science | 1997-11-12 | Paper |
Robert G. Jeroslow 1942-1988
Annals of Mathematics and Artificial Intelligence | 1997-08-21 | Paper |
A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
Operations Research | 1997-08-03 | Paper |
Gomory cuts revisited
Operations Research Letters | 1997-07-06 | Paper |
| scientific article; zbMATH DE number 956841 (Why is no real title available?) | 1997-06-09 | Paper |
| scientific article; zbMATH DE number 956840 (Why is no real title available?) | 1996-12-11 | Paper |
The prize collecting traveling salesman problem: II. Polyhedral results
Networks | 1996-08-19 | Paper |
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
Algorithmica | 1996-05-27 | Paper |
| scientific article; zbMATH DE number 776090 (Why is no real title available?) | 1995-07-18 | Paper |
The One-Machine Problem with Delayed Precedence Constraints and its Use in Job Shop Scheduling
Management Science | 1995-07-04 | Paper |
The precedence-constrained asymmetric traveling salesman polytope
Mathematical Programming. Series A. Series B | 1995-05-28 | Paper |
A parallel shortest augmenting path algorithm for the assignment problem
Journal of the ACM | 1994-08-21 | Paper |
| scientific article; zbMATH DE number 437548 (Why is no real title available?) | 1993-12-15 | Paper |
A lift-and-project cutting plane algorithm for mixed 0-1 programs
Mathematical Programming. Series A. Series B | 1993-08-17 | Paper |
A lifting procedure for asymmetric traveling salesman polytope and a large new class of facets
Mathematical Programming. Series A. Series B | 1993-08-17 | Paper |
Linear-time separation algorithms for the three-index assignment polytope
Discrete Applied Mathematics | 1993-08-17 | Paper |
The Fixed-Outdegree 1-Arborescence Polytope
Mathematics of Operations Research | 1993-03-01 | Paper |
Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
SIAM Journal on Computing | 1992-12-06 | Paper |
An Algorithm for the Three-Index Assignment Problem
Operations Research | 1992-06-26 | Paper |
Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs
SIAM Journal on Computing | 1991-01-01 | Paper |
The Asymmetric Assignment Problem and Some New Facets of the Traveling Salesman Polytope on a Directed Graph
SIAM Journal on Discrete Mathematics | 1989-01-01 | Paper |
Facets of the three-index assignment polytope
Discrete Applied Mathematics | 1989-01-01 | Paper |
The prize collecting traveling salesman problem
Networks | 1989-01-01 | Paper |
On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
On graphs with polynomially solvable maximum-weight clique problem
Networks | 1989-01-01 | Paper |
Sequential convexification in reverse convex and disjunctive programming
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
On the set covering polytope. II: Lifting the facets with coefficients in \(\{\) 0,1,2\(\}\)
Mathematical Programming. Series A. Series B | 1989-01-01 | Paper |
The perfectly matchable subgraph polytope of an arbitrary graph
Combinatorica | 1989-01-01 | Paper |
The Shifting Bottleneck Procedure for Job Shop Scheduling
Management Science | 1988-01-01 | Paper |
On the convex hull of the union of certain polyhedra
Operations Research Letters | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4077256 (Why is no real title available?) | 1987-01-01 | Paper |
Comment on 'Some computational results on real 0-1 knapsack problems'
Operations Research Letters | 1987-01-01 | Paper |
On the Maximum Weight Clique Problem
Mathematics of Operations Research | 1987-01-01 | Paper |
A fast algorithm for finding an edge-maximal subgraph with a TR-formative coloring
Discrete Applied Mathematics | 1986-01-01 | Paper |
Finding a Maximum Clique in an Arbitrary Graph
SIAM Journal on Computing | 1986-01-01 | Paper |
On the facial structure of scheduling polyhedra
Mathematical Programming Essays in Honor of George B. Dantzig Part I | 1985-01-01 | Paper |
Disjunctive Programming and a Hierarchy of Relaxations for Discrete Optimization Problems
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3908167 (Why is no real title available?) | 1985-01-01 | Paper |
A Sharp Bound on the Ratio Between Optimal Integer and Fractional Covers
Mathematics of Operations Research | 1984-01-01 | Paper |
| scientific article; zbMATH DE number 3874956 (Why is no real title available?) | 1984-01-01 | Paper |
Nonlinear 0–1 programming: I. Linearization techniques
Mathematical Programming | 1984-01-01 | Paper |
Nonlinear 0–1 programming: II. Dominance relations and algorithms
Mathematical Programming | 1984-01-01 | Paper |
Bender's method revisited
Journal of Computational and Applied Mathematics | 1983-01-01 | Paper |
The perfectly matchable subgraph polytope of a bipartite graph
Networks | 1983-01-01 | Paper |
Correction to Disjunctive programming
Discrete Applied Mathematics | 1983-01-01 | Paper |
Traffic assignment in communication satellites
Operations Research Letters | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3831680 (Why is no real title available?) | 1982-01-01 | Paper |
Integer and Fractional Matchings
North-Holland Mathematics Studies | 1981-01-01 | Paper |
A restricted Lagrangean approach to the traveling salesman problem
Mathematical Programming | 1981-01-01 | Paper |
Cutting planes from conditional bounds: A new approach to set covering
Mathematical Programming Studies | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3685228 (Why is no real title available?) | 1980-01-01 | Paper |
Strengthening cuts for mixed integer programs
European Journal of Operational Research | 1980-01-01 | Paper |
An Algorithm for Large Zero-One Knapsack Problems
Operations Research | 1980-01-01 | Paper |
Pivot and Complement–A Heuristic for 0-1 Programming
Management Science | 1980-01-01 | Paper |
| scientific article; zbMATH DE number 3643033 (Why is no real title available?) | 1979-01-01 | Paper |
Adjacent vertices of the all 0-1 programming polytope
RAIRO - Operations Research | 1979-01-01 | Paper |
Disjunctive Programming
Discrete Optimization II, 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 co-sponsored by IBM Canada and SIAM Banff, Aha. and Vancouver | 1979-01-01 | Paper |
Facets of the Knapsack Polytope From Minimal Covers
SIAM Journal on Applied Mathematics | 1978-01-01 | Paper |
A node covering algorithm
Naval Research Logistics Quarterly | 1977-01-01 | Paper |
Graph substitution and set packing polytopes
Networks | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3561085 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3699703 (Why is no real title available?) | 1977-01-01 | Paper |
A note on duality in disjunctive programming
Journal of Optimization Theory and Applications | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3545384 (Why is no real title available?) | 1976-01-01 | Paper |
Set Partitioning: A survey
SIAM Review | 1976-01-01 | Paper |
Nonconvex Quadratic Programming via Generalized Polars
SIAM Journal on Applied Mathematics | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3485516 (Why is no real title available?) | 1975-01-01 | Paper |
Intersection cuts from outer polars of truncated cubes
Naval Research Logistics Quarterly | 1975-01-01 | Paper |
Facets of the knapsack polytope
Mathematical Programming | 1975-01-01 | Paper |
| scientific article; zbMATH DE number 3545380 (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 |
Technical Note—A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case
Operations Research | 1973-01-01 | Paper |
Ranking the facets of the octahedron
Discrete Mathematics | 1972-01-01 | Paper |
Canonical Cuts on the Unit Hypercube
SIAM Journal on Applied Mathematics | 1972-01-01 | Paper |
On the Set-Covering Problem
Operations Research | 1972-01-01 | Paper |
Integer programming and convex analysis: Intersection cuts from outer polars
Mathematical Programming | 1972-01-01 | Paper |
An Intersection Cut from the Dual of the Unit Hypercube
Operations Research | 1971-01-01 | Paper |
A duality theorem and an algorithm for (mixed-) integer nonlinear programming
Linear Algebra and its Applications | 1971-01-01 | Paper |
Intersection Cuts—A New Type of Cutting Planes for Integer Programming
Operations Research | 1971-01-01 | Paper |
| scientific article; zbMATH DE number 3353073 (Why is no real title available?) | 1970-01-01 | Paper |
Machine sequencing: Disjunctive graphs and degree-constrained subgraphs
Naval Research Logistics Quarterly | 1970-01-01 | Paper |
| scientific article; zbMATH DE number 3540635 (Why is no real title available?) | 1970-01-01 | Paper |
Machine Sequencing Via Disjunctive Graphs: An Implicit Enumeration Algorithm
Operations Research | 1969-01-01 | Paper |
Duality in Discrete Programming: II. The Quadratic Case
Management Science | 1969-01-01 | Paper |
| scientific article; zbMATH DE number 3253630 (Why is no real title available?) | 1968-01-01 | Paper |
Letter to the Editor—A Note on the Branch-and-Bound Principle
Operations Research | 1968-01-01 | Paper |
| scientific article; zbMATH DE number 3253628 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3253629 (Why is no real title available?) | 1967-01-01 | Paper |
| scientific article; zbMATH DE number 3412433 (Why is no real title available?) | 1967-01-01 | Paper |
Discrete Programming by the Filter Method
Operations Research | 1967-01-01 | Paper |
An Infeasibility-Pricing Decomposition Method for Linear Programs
Operations Research | 1966-01-01 | Paper |
| scientific article; zbMATH DE number 3216827 (Why is no real title available?) | 1966-01-01 | Paper |
| scientific article; zbMATH DE number 3220808 (Why is no real title available?) | 1966-01-01 | Paper |
The Dual Method for the Generalized Transportation Problem
Management Science | 1966-01-01 | Paper |
| scientific article; zbMATH DE number 3228285 (Why is no real title available?) | 1965-01-01 | Paper |
| scientific article; zbMATH DE number 3216824 (Why is no real title available?) | 1965-01-01 | Paper |
| scientific article; zbMATH DE number 3219388 (Why is no real title available?) | 1965-01-01 | Paper |
| scientific article; zbMATH DE number 3219389 (Why is no real title available?) | 1965-01-01 | Paper |
An Additive Algorithm for Solving Linear Programs with Zero-One Variables
Operations Research | 1965-01-01 | Paper |
An Additive Algorithm for Solving Linear Programs with Zero-One Variables
Operations Research | 1965-01-01 | Paper |
Solution of Large-Scale Transportation Problems Through Aggregation
Operations Research | 1965-01-01 | Paper |
| scientific article; zbMATH DE number 3277140 (Why is no real title available?) | 1964-01-01 | Paper |
On the Generalized Transportation Problem
Management Science | 1964-01-01 | Paper |
| scientific article; zbMATH DE number 3332070 (Why is no real title available?) | 1964-01-01 | Paper |
| scientific article; zbMATH DE number 3192540 (Why is no real title available?) | 1963-01-01 | Paper |
| scientific article; zbMATH DE number 3175709 (Why is no real title available?) | 1962-01-01 | Paper |
| scientific article; zbMATH DE number 3188110 (Why is no real title available?) | 1962-01-01 | Paper |
| scientific article; zbMATH DE number 3190862 (Why is no real title available?) | 1961-01-01 | Paper |
| scientific article; zbMATH DE number 3202056 (Why is no real title available?) | 1961-01-01 | Paper |
| scientific article; zbMATH DE number 3272841 (Why is no real title available?) | 1961-01-01 | Paper |
| scientific article; zbMATH DE number 3272842 (Why is no real title available?) | 1961-01-01 | Paper |
| scientific article; zbMATH DE number 3272840 (Why is no real title available?) | 1960-01-01 | Paper |
