Found: 52
Select item for more details and to access through your institution.
LIFTED CYCLE INEQUALITIES FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM.
- Published in:
- Mathematics of Operations Research, 1999, v. 24, n. 2, p. 273, doi. 10.1287/moor.24.2.273
- By:
- Publication type:
- Article
ERRATUM: CRITICAL CUTSETS OF GRAPHS AND CANONICAL FACETS OF SET PACKING POLYTOPES.
- Published in:
- 1998
- By:
- Publication type:
- Erratum
THE FIXED-OUTDEGREE 1-ARBORESCENCE POLYTOPE.
- Published in:
- Mathematics of Operations Research, 1992, v. 17, n. 4, p. 1001, doi. 10.1287/moor.17.4.1001
- By:
- Publication type:
- Article
ON THE MAXIMUM WEIGHT CLIQUE PROBLEM.
- Published in:
- Mathematics of Operations Research, 1987, v. 12, n. 3, p. 522, doi. 10.1287/moor.12.3.522
- By:
- Publication type:
- Article
A SHARP BOUND ON THE RATIO BETWEEN OPTIMAL INTEGER AND FRACTIONAL COVERS.
- Published in:
- Mathematics of Operations Research, 1984, v. 9, n. 1, p. 1, doi. 10.1287/moor.9.1.1
- By:
- Publication type:
- Article
CRITICAL CUTSETS OF GRAPHS AND CANONICAL FACETS OF SET-PACKING POLYTOPES.
- Published in:
- Mathematics of Operations Research, 1977, v. 2, n. 1, p. 15, doi. 10.1287/moor.2.1.15
- By:
- Publication type:
- Article
Combining Lift-and-Project and Reduce-and-Split.
- Published in:
- INFORMS Journal on Computing, 2013, v. 25, n. 3, p. 475, doi. 10.1287/ijoc.1120.0515
- By:
- Publication type:
- Article
Linear Time Dynamic-Programming Algorithms for New Classes of Restricted TSPs: A Computational Study.
- Published in:
- INFORMS Journal on Computing, 2001, v. 13, n. 1, p. 56, doi. 10.1287/ijoc.13.1.56.9748
- By:
- Publication type:
- Article
When Lift-and-Project Cuts Are Different.
- Published in:
- INFORMS Journal on Computing, 2020, v. 32, n. 3, p. 822, doi. 10.1287/ijoc.2019.0943
- By:
- Publication type:
- Article
On the cycle polytope of a directed graph and its relaxations.
- Published in:
- Networks, 2009, v. 54, n. 1, p. 47, doi. 10.1002/net.20304
- By:
- Publication type:
- Article
On the cycle polytope of a directed graph.
- Published in:
- Networks, 2000, v. 36, n. 1, p. 34, doi. 10.1002/1097-0037(200008)36:1<34::AID-NET4>3.0.CO;2-2
- By:
- Publication type:
- Article
The prize collecting traveling salesman problem: II. Polyhedral results.
- Published in:
- Networks, 1995, v. 25, n. 4, p. 199, doi. 10.1002/net.3230250406
- By:
- Publication type:
- Article
The prize collecting traveling salesman problem.
- Published in:
- Networks, 1989, v. 19, n. 6, p. 621, doi. 10.1002/net.3230190602
- By:
- Publication type:
- Article
On graphs with polynomially solvable maximum-weight clique problem.
- Published in:
- Networks, 1989, v. 19, n. 2, p. 247, doi. 10.1002/net.3230190206
- By:
- Publication type:
- Article
The perfectly matchable subgraph polytope of a bipartite graph.
- Published in:
- Networks, 1983, v. 13, n. 4, p. 495, doi. 10.1002/net.3230130405
- By:
- Publication type:
- Article
Job shop scheduling with setup times, deadlines and precedence constraints.
- Published in:
- Journal of Scheduling, 2008, v. 11, n. 4, p. 253, doi. 10.1007/s10951-008-0067-7
- By:
- Publication type:
- Article
On the relationship between standard intersection cuts, lift-and-project cuts, and generalized intersection cuts.
- Published in:
- Mathematical Programming, 2016, v. 160, n. 1/2, p. 85, doi. 10.1007/s10107-015-0975-1
- By:
- Publication type:
- Article
Generalized intersection cuts and a new cut generating paradigm.
- Published in:
- Mathematical Programming, 2013, v. 137, n. 1/2, p. 19, doi. 10.1007/s10107-011-0483-x
- By:
- Publication type:
- Article
A hard integer program made easy by lexicography.
- Published in:
- Mathematical Programming, 2012, v. 135, n. 1/2, p. 509, doi. 10.1007/s10107-011-0450-6
- By:
- Publication type:
- Article
Lexicography and degeneracy: can a pure cutting plane algorithm work?
- Published in:
- Mathematical Programming, 2011, v. 130, n. 1, p. 153, doi. 10.1007/s10107-009-0335-0
- By:
- Publication type:
- Article
On the enumerative nature of Gomory's dual cutting plane method.
- Published in:
- Mathematical Programming, 2010, v. 125, n. 2, p. 325, doi. 10.1007/s10107-010-0392-4
- By:
- Publication type:
- Article
Optimizing over the split closure.
- Published in:
- Mathematical Programming, 2008, v. 113, n. 2, p. 219, doi. 10.1007/s10107-006-0049-5
- By:
- Publication type:
- Article
The vertex separator problem: a polyhedral investigation.
- Published in:
- Mathematical Programming, 2005, v. 103, n. 3, p. 583, doi. 10.1007/s10107-005-0574-7
- By:
- Publication type:
- Article
The vertex separator problem: algorithms and computations.
- Published in:
- Mathematical Programming, 2005, v. 103, n. 3, p. 609, doi. 10.1007/s10107-005-0573-8
- By:
- Publication type:
- Article
On unions and dominants of polytopes.
- Published in:
- Mathematical Programming, 2004, v. 99, n. 2, p. 223, doi. 10.1007/s10107-003-0432-4
- By:
- Publication type:
- Article
A precise correspondence between lift-and-project cuts, simple disjunctive cuts, and mixed integer gomory cuts for 0-1 programming.
- Published in:
- Mathematical Programming, 2003, v. 94, n. 2/3, p. 221, doi. 10.1007/s10107-002-0317-y
- By:
- Publication type:
- Article
OCTANE: A NEW HEURISTIC FOR PURE 0-1 PROGRAMS.
- Published in:
- Operations Research, 2001, v. 49, n. 2, p. 207, doi. 10.1287/opre.49.2.207.13535
- By:
- Publication type:
- Article
A dynamic subgradient-based branch-and-bound procedure for set covering.
- Published in:
- Operations Research, 1996, v. 44, n. 6, p. 875, doi. 10.1287/opre.44.6.875
- By:
- Publication type:
- Article
AN ALGORITHM FOR THE THREE-INDEX ASSIGNMENT.
- Published in:
- Operations Research, 1991, v. 39, n. 1, p. 150, doi. 10.1287/opre.39.1.150
- By:
- Publication type:
- Article
An Algorithm for Large Zero-One Knapsack Problems.
- Published in:
- Operations Research, 1980, v. 28, n. 5, p. 1130, doi. 10.1287/opre.28.5.1130
- By:
- Publication type:
- Article
On the Set-Covering Problem: II. An Algorithm for Set Partitioning.
- Published in:
- Operations Research, 1975, v. 23, n. 1, p. 74, doi. 10.1287/opre.23.1.74
- By:
- Publication type:
- Article
A Note on the Group Theoretic Approach to Integer Programming and the 0-1 Case.
- Published in:
- Operations Research, 1973, v. 21, n. 1, p. 321, doi. 10.1287/opre.21.1.321
- By:
- Publication type:
- Article
On the Set-Covering Problem.
- Published in:
- Operations Research, 1972, v. 20, n. 6, p. 1152, doi. 10.1287/opre.20.6.1152
- By:
- Publication type:
- Article
AN INTERSECTION CUT FROM THE DUAL OF THE UNIT HYPERCUBE.
- Published in:
- Operations Research, 1971, v. 19, n. 1, p. 40, doi. 10.1287/opre.19.1.40
- By:
- Publication type:
- Article
INTERSECTION CUTS -- A NEW TYPE OF CUTTING PLANES FOR INTEGER PROGRAMMING.
- Published in:
- Operations Research, 1971, v. 19, n. 1, p. 19, doi. 10.1287/opre.19.1.19
- By:
- Publication type:
- Article
MACHINE SEQUENCING VIA DISJUNCTIVE GRAPHS: AN IMPLICIT ENUMERATION ALGORITHM.
- Published in:
- Operations Research, 1969, v. 17, n. 6, p. 941, doi. 10.1287/opre.17.6.941
- By:
- Publication type:
- Article
DISCRETE PROGRAMMING BY THE FILTER METHOD.
- Published in:
- Operations Research, 1967, v. 15, n. 5, p. 915, doi. 10.1287/opre.15.5.915
- By:
- Publication type:
- Article
COMMENTS ON THE PRECEDING NOTE.
- Published in:
- 1966
- By:
- Publication type:
- Letter
AN INFEASIBILITY-PRICING DECOMPOSITION METHOD FOR LINEAR PROGRAMS.
- Published in:
- Operations Research, 1966, v. 14, n. 5, p. 847, doi. 10.1287/opre.14.5.847
- By:
- Publication type:
- Article
AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH ZERO-ONE VARIABLES.
- Published in:
- Operations Research, 1965, v. 13, n. 4, p. 517, doi. 10.1287/opre.13.4.517
- By:
- Publication type:
- Article
SOLUTION OF LARGE-SCALE TRANSPORTATION PROBLEMS THROUGH AGGREGATION.
- Published in:
- Operations Research, 1965, v. 13, n. 1, p. 82, doi. 10.1287/opre.13.1.82
- By:
- Publication type:
- Article
Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework.
- Published in:
- Management Science, 1996, v. 42, n. 9, p. 1229, doi. 10.1287/mnsc.42.9.1229
- By:
- Publication type:
- Article
The One-machine Problem with Delayed Precedence Constraints and Its Use in Job Shop Scheduling.
- Published in:
- Management Science, 1995, v. 41, n. 1, p. 94, doi. 10.1287/mnsc.41.1.94
- By:
- Publication type:
- Article
THE SHIFTING BOTTLENECK PROCEDURE FOR JOB SHOP SCHEDULING.
- Published in:
- Management Science, 1988, v. 34, n. 3, p. 391, doi. 10.1287/mnsc.34.3.391
- By:
- Publication type:
- Article
PIVOT AND COMPLEMENT--A HEURISTIC FOR 0-1 PROGRAMMING.
- Published in:
- Management Science, 1980, v. 26, n. 1, p. 86, doi. 10.1287/mnsc.26.1.86
- By:
- Publication type:
- Article
DUALITY IN DISCRETE PROGRAMMING: II. THE QUADRATIC CASE.
- Published in:
- Management Science, 1969, v. 16, n. 1, p. 14, doi. 10.1287/mnsc.16.1.14
- By:
- Publication type:
- Article
THE DUAL METHOD FOR THE GENERALIZED TRANSPORTATION PROBLEM.
- Published in:
- Management Science, 1966, v. 12, n. 7, p. 555, doi. 10.1287/mnsc.12.7.555
- By:
- Publication type:
- Article
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling.
- Published in:
- Management Science, 1998, v. 44, n. 2, p. 262, doi. 10.1287/mnsc.44.2.262
- By:
- Publication type:
- Article
Projecting systems of linear inequalities with binary variables.
- Published in:
- Annals of Operations Research, 2011, v. 188, n. 1, p. 19, doi. 10.1007/s10479-009-0623-3
- By:
- Publication type:
- Article
Some thoughts on the development of integer programming during my research career.
- Published in:
- Annals of Operations Research, 2007, v. 149, n. 1, p. 19, doi. 10.1007/s10479-006-0093-9
- By:
- Publication type:
- Article