George L. Nemhauser

Alejandro Toriello

Comput. Oper. Res., 2024

2022

An exact algorithm for the service network design problem with hub capacity constraints.

[BibT_eX]

[DOI]

Edward He

Networks, 2022

Decomposition of loosely coupled integer programs: a multiobjective perspective.

[BibT_eX]

[DOI]

Math. Program., 2022

Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems.

[BibT_eX]

[DOI]

Edward Yuhang He

INFORMS J. Comput., 2022

State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems.

[BibT_eX]

[DOI]

Hossein Hashemi Doulabi

INFORMS J. Comput., 2022

2021

Time-Dependent Shortest Path Problems with Penalties and Limits on Waiting.

[BibT_eX]

[DOI]

Edward He

INFORMS J. Comput., 2021

Decentralized online integer programming problems with a coupling cardinality constraint.

[BibT_eX]

[DOI]

Ezgi Karabulut

Comput. Oper. Res., 2021

2020

A linear programming based approach to the Steiner tree problem with a fixed number of terminals.

[BibT_eX]

[DOI]

Matías Siebert

Networks, 2020

Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint.

[BibT_eX]

[DOI]

Ezgi Karabulut

Discret. Optim., 2020

A Simulated Annealing Algorithm for the Directed Steiner Tree Problem.

[BibT_eX]

[DOI]

Matías Siebert

CoRR, 2020

2019

Tailoring parallel alternating criteria search for domain specific MIPs: Application to maritime inventory routing.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2019

2018

Lot targeting and lot dispatching decision policies for semiconductor manufacturing: optimisation under uncertainty with simulation validation.

[BibT_eX]

[DOI]

Int. J. Prod. Res., 2018

Flexible solutions to maritime inventory routing problems with delivery time windows.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2018

Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2018

A Dynamic Discretization Discovery Algorithm for the Minimum Duration Time-Dependent Shortest Path Problem.

[BibT_eX]

[DOI]

Edward He

Proceedings of the Integration of Constraint Programming, Artificial Intelligence, and Operations Research, 2018

2017

Erratum to: An abstract model for branching and its application to mixed integer programming.

[BibT_eX]

[DOI]

Pierre Le Bodic

Math. Program., 2017

An abstract model for branching and its application to mixed integer programming.

[BibT_eX]

[DOI]

Pierre Le Bodic

Carlos Eduardo de Andrade

Math. Program., 2017

A hybrid primal heuristic for finding feasible solutions to mixed integer programs.

[BibT_eX]

[DOI]

Yufen Shao

Eur. J. Oper. Res., 2017

A parallel local search framework for the Fixed-Charge Multicommodity Network Flow problem.

[BibT_eX]

[DOI]

Comput. Oper. Res., 2017

Learning to Run Heuristics in Tree Search.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Estimating the size of search trees by sampling with domain knowledge.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016

On the Computational Complexity of Minimum-Concave-Cost Flow in a Two-Dimensional Grid.

[BibT_eX]

[DOI]

SIAM J. Optim., 2016

Learning to Branch in Mixed Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015

Approximate Dynamic Programming for a Class of Long-Horizon Maritime Inventory Routing Problems.

[BibT_eX]

[DOI]

Myun-Seok Cheon

Joel Sokol

Transp. Sci., 2015

A dual heuristic for mixed integer programming.

[BibT_eX]

[DOI]

Yaxian Li

Özlem Ergun

Oper. Res. Lett., 2015

How important are branching decisions: Fooling MIP solvers.

[BibT_eX]

[DOI]

Pierre Le Bodic

Oper. Res. Lett., 2015

Minimum concave cost flow over a grid network.

[BibT_eX]

[DOI]

Qie He

Math. Program., 2015

2014

A cutting and scheduling problem in float glass manufacturing.

[BibT_eX]

[DOI]

J. Sched., 2014

Using diversification, communication and parallelism to solve mixed-integer linear programs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2014

Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing.

[BibT_eX]

[DOI]

Joel S. Sokol

INFORMS J. Comput., 2014

MIRPLib - A library of maritime inventory routing problem instances: Survey, core model, and benchmark results.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2014

Congestion-aware dynamic routing in automated material handling systems.

[BibT_eX]

[DOI]

Comput. Ind. Eng., 2014

2013

Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2013

Restrict-and-relax search for 0-1 mixed-integer programs.

[BibT_eX]

[DOI]

Menal Guzelsoy

EURO J. Comput. Optim., 2013

A branch-and-price guided search approach to maritime inventory routing.

[BibT_eX]

[DOI]

Jin-Hwa Song

Comput. Oper. Res., 2013

2012

Fixed-Charge Transportation with Product Blending.

[BibT_eX]

[DOI]

Alejandro Toriello

Transp. Sci., 2012

Mixed integer linear programming formulations for probabilistic constraints.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2012

The value function of an infinite-horizon single-item lot-sizing problem.

[BibT_eX]

[DOI]

Alejandro Toriello

Oper. Res. Lett., 2012

Sell or Hold: A simple two-stage stochastic combinatorial optimization problem.

[BibT_eX]

[DOI]

Qie He

Oper. Res. Lett., 2012

A Branch-Price-and-Cut Algorithm for Single-Product Maritime Inventory Routing.

[BibT_eX]

[DOI]

Faramroze G. Engineer

Kevin C. Furman

Jin-Hwa Song

Oper. Res., 2012

The Fixed-Charge Shortest-Path Problem.

[BibT_eX]

[DOI]

Faramroze G. Engineer

Jin-Hwa Song

INFORMS J. Comput., 2012

Pricing for production and delivery flexibility in single-item lot-sizing.

[BibT_eX]

[DOI]

Yaxian Li

Comput. Oper. Res., 2012

Branch-and-Price Guided Search - (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2011

A Probabilistic Comparison of Split and Type 1 Triangle Cuts for Two-Row Mixed-Integer Programs.

[BibT_eX]

[DOI]

Qie He

SIAM J. Optim., 2011

Modeling disjunctive constraints with a logarithmic number of binary variables and constraints.

[BibT_eX]

[DOI]

Math. Program., 2011

Lifted Tableaux Inequalities for 0-1 Mixed-Integer Programs: A Computational Study.

[BibT_eX]

[DOI]

Amar Kumar Narisetty

INFORMS J. Comput., 2011

Dynamic Programming-Based Column Generation on Time-Expanded Networks: Application to the Dial-a-Flight Problem.

[BibT_eX]

[DOI]

Faramroze G. Engineer

INFORMS J. Comput., 2011

2010

Tactical and Operational Planning of Scheduled Maintenance for Per-Seat, On-Demand Air Transportation.

[BibT_eX]

[DOI]

Gizem Keysan

Transp. Sci., 2010

An integer programming approach for linear programs with probabilistic constraints.

[BibT_eX]

[DOI]

James R. Luedtke

Math. Program., 2010

Mixed-Integer Models for Nonseparable Piecewise-Linear Optimization: Unifying Framework and Extensions.

[BibT_eX]

[DOI]

Oper. Res., 2010

A Note on "A Superior Representation Method for Piecewise Linear Functions".

[BibT_eX]

[DOI]

INFORMS J. Comput., 2010

Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2010

Automated Channel Abstraction for Advertising Auctions.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Approximating the stability region for binary mixed-integer programs.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2009

Information-based branching schemes for binary linear mixed integer problems.

[BibT_eX]

[DOI]

Fatma Kilinç-Karzan

Math. Program. Comput., 2009

Strategic Planning with Start-Time Dependent Variable Costs.

[BibT_eX]

[DOI]

James R. Luedtke

Oper. Res., 2009

Cutting Planes for Multistage Stochastic Integer Programs.

[BibT_eX]

[DOI]

Yongpei Guan

Oper. Res., 2009

Using Branch-and-Price to Find High Quality Solutions Quickly.

[BibT_eX]

[DOI]

Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

2008

Per-Seat, On-Demand Air Transportation Part II: Parallel Local Search.

[BibT_eX]

[DOI]

Transp. Sci., 2008

Per-Seat, On-Demand Air Transportation Part I: Problem Description and an Integer Multicommodity Flow Model.

[BibT_eX]

[DOI]

Transp. Sci., 2008

A Lifted Linear Programming Branch-and-Bound Algorithm for Mixed-Integer Conic Quadratic Programs.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2008

Nonconvex, lower semicontinuous piecewise linear optimization.

[BibT_eX]

[DOI]

Discret. Optim., 2008

Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements.

[BibT_eX]

[DOI]

Jill R. Hardin

Discret. Optim., 2008

George Dantzig's contributions to integer programming.

[BibT_eX]

[DOI]

Martin Grötschel

Discret. Optim., 2008

2007

Sequential pairing of mixed integer inequalities.

[BibT_eX]

[DOI]

Yongpei Guan

Discret. Optim., 2007

Analysis of bounds for a capacitated single-item lot-sizing problem.

[BibT_eX]

[DOI]

Jill R. Hardin

Comput. Oper. Res., 2007

Hooked on IP.

[BibT_eX]

[DOI]

Ann. Oper. Res., 2007

Chapter 1 Air Transportation: Irregular Operations and Control.

[BibT_eX]

[DOI]

Proceedings of the Transportation, 2007

2006

On formulations of the stochastic uncapacitated lot-sizing problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2006

A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem.

[BibT_eX]

[DOI]

Math. Program., 2006

A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization.

[BibT_eX]

[DOI]

Oper. Res., 2006

Short-term booking of air cargo space.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2006

An optimization approach for planning daily drayage operations.

[BibT_eX]

[DOI]

Central Eur. J. Oper. Res., 2006

Improving airline operational performance through schedule perturbation.

[BibT_eX]

[DOI]

Andrew J. Schaefer

Ann. Oper. Res., 2006

2005

Airline Crew Scheduling Under Uncertainty.

[BibT_eX]

[DOI]

Transp. Sci., 2005

A branch-and-cut algorithm for nonconvex quadratic programs with box constraints.

[BibT_eX]

[DOI]

Dieter Vandenbussche

Math. Program., 2005

A polyhedral study of nonconvex quadratic programs with box constraints.

[BibT_eX]

[DOI]

Dieter Vandenbussche

Math. Program., 2005

The 2-Edge-Connected Subgraph Polyhedron.

[BibT_eX]

[DOI]

Dieter Vandenbussche

J. Comb. Optim., 2005

2004

Sports Scheduling.

[BibT_eX]

[DOI]

Kelly Easton

Proceedings of the Handbook of Scheduling - Algorithms, Models, and Performance Analysis., 2004

A Robust Fleet-Assignment Model with Hub Isolation and Short Cycles.

[BibT_eX]

[DOI]

Jay M. Rosenberger

Transp. Sci., 2004

Models for representing piecewise linear cost functions.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2004

2003

Rerouting Aircraft for Airline Recovery.

[BibT_eX]

[DOI]

Jay M. Rosenberger

Transp. Sci., 2003

Lifted inequalities for 0-1 mixed integer programming: Superlinear lifting.

[BibT_eX]

[DOI]

Math. Program., 2003

Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms.

[BibT_eX]

[DOI]

Math. Program., 2003

On the polyhedral structure of a multi-item production planning model with setup times.

[BibT_eX]

[DOI]

Math. Program., 2003

A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case.

[BibT_eX]

[DOI]

Math. Program., 2003

A polyhedral study of the cardinality constrained knapsack problem.

[BibT_eX]

[DOI]

Math. Program., 2003

The Sample Average Approximation Method Applied to Stochastic Routing Problems: A Computational Study.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2003

2002

A Stochastic Model of Airline Operations.

[BibT_eX]

[DOI]

Transp. Sci., 2002

Airline Crew Scheduling with Time Windows and Plane-Count Constraints.

[BibT_eX]

[DOI]

Transp. Sci., 2002

A Polyhedral Study of Integer Variable Upper Bounds.

[BibT_eX]

[DOI]

Diego Klabjan

Math. Oper. Res., 2002

Facets of the Complementarity Knapsack Polytope.

[BibT_eX]

[DOI]

Math. Oper. Res., 2002

Management of Railroad Impedances for Shortest Path-based Routing.

[BibT_eX]

[DOI]

Jeff Day

Joel S. Sokol

Proceedings of the Algorithmic Methods and Models for Optimization of Railways, 2002

Solving the Travelling Tournament Problem: A Combined Integer Programming and Constraint Programming Approach.

[BibT_eX]

[DOI]

Kelly Easton

Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

2001

Airline Crew Scheduling with Regularity.

[BibT_eX]

[DOI]

Transp. Sci., 2001

A family of inequalities for the generalized assignment polytope.

[BibT_eX]

[DOI]

Oper. Res. Lett., 2001

Valid inequalities for problems with additive variable upper bounds.

[BibT_eX]

[DOI]

Math. Program., 2001

Branch-and-cut for combinatorial optimization problems without auxiliary binary variables.

[BibT_eX]

[DOI]

Knowl. Eng. Rev., 2001

Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 2001

Dynamic Network Flow with Uncertain Arc Capacities: Decomposition Algorithm and Computational Results.

[BibT_eX]

[DOI]

Gregory D. Glockner

Craig A. Tovey

Comput. Optim. Appl., 2001

Facets, Algorithms, and Polyhedral Characterizations for a Multi-item Production Planning Model with Setup Times.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 2001

The Traveling Tournament Problem Description and Benchmarks.

[BibT_eX]

[DOI]

Kelly Easton

Proceedings of the Principles and Practice of Constraint Programming, 2001

A Simplex-Based Algorithm for 0-1 Mixed Integer Programming.

[BibT_eX]

[DOI]

Proceedings of the Combinatorial Optimization, 2001

2000

Airline Crew Recovery.

[BibT_eX]

[DOI]

Ladislav Lettovsky

Transp. Sci., 2000

A parallel primal-dual simplex algorithm.

[BibT_eX]

[DOI]

Diego Klabjan

Oper. Res. Lett., 2000

A generalized assignment problem with special ordered sets: a polyhedral approach.

[BibT_eX]

[DOI]

Math. Program., 2000

The mixed vertex packing problem.

[BibT_eX]

[DOI]

Math. Program., 2000

Sequence Independent Lifting in Mixed Integer Programming.

[BibT_eX]

[DOI]

J. Comb. Optim., 2000

A Dynamic Network Flow Problem with Uncertain Arc Capacities: Formulation and Problem Structure.

[BibT_eX]

[DOI]

Gregory D. Glockner

Oper. Res., 2000

Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition.

[BibT_eX]

[DOI]

INFORMS J. Comput., 2000

On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

The asymmetric traveling salesman problem with replenishment arcs.

[BibT_eX]

[DOI]

Natashia L. Boland

Lloyd W. Clarke

Eur. J. Oper. Res., 2000

Conflict graphs in solving integer programming problems.

[BibT_eX]

[DOI]

Eur. J. Oper. Res., 2000

Air transportation simulation: SimAir: a stochastic model of airline operations.

[BibT_eX]

[DOI]

Proceedings of the 32nd conference on Winter simulation, 2000

1999

Allocating Fibers in Cable Manufacturing.

[BibT_eX]

[DOI]

Manuf. Serv. Oper. Manag., 1999

Lifted flow cover inequalities for mixed 0-1 integer programs.

[BibT_eX]

[DOI]

Math. Program., 1999

Price-Directed Control of Remnant Inventory Systems.

[BibT_eX]

[DOI]

Daniel Adelman

Oper. Res., 1999

Lifted Cover Inequalities for 0-1 Integer Programs: Complexity.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1999

1998

Flight String Models for Aircraft Fleeting and Routing.

[BibT_eX]

[DOI]

Transp. Sci., 1998

The complexity of cover inequality separation.

[BibT_eX]

[DOI]

Diego Klabjan

Craig A. Tovey

Oper. Res. Lett., 1998

Scheduling A Major College Basketball Conference.

[BibT_eX]

[DOI]

Oper. Res., 1998

Branch-and-Price: Column Generation for Solving Huge Integer Programs.

[BibT_eX]

[DOI]

Cynthia Barnhart

Pamela H. Vance

Oper. Res., 1998

Lifted Cover Inequalities for 0-1 Integer Programs: Computation.

[BibT_eX]

[DOI]

INFORMS J. Comput., 1998

Polyhedral Characterizations, Perfection of Line Graphs.

[BibT_eX]

[DOI]

Dasong Cao

Discret. Appl. Math., 1998

1997

Airline Crew Scheduling: A New Formulation and Decomposition Algorithm.

[BibT_eX]

[DOI]

Oper. Res., 1997

The aircraft rotation problem.

[BibT_eX]

[DOI]

Ann. Oper. Res., 1997

1996

Maintenance and Crew Considerations in Fleet Assignment.

[BibT_eX]

[DOI]

Transp. Sci., 1996

A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems.

[BibT_eX]

[DOI]

J. Heuristics, 1996

Branch-and-Price for Solving Integer Programs with a Huge Number of Variables: Methods and Applications (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Second International Conference on Principles and Practice of Constraint Programming, 1996

1995

The fleet assignment problem: Solving a large-scale integer program.

[BibT_eX]

[DOI]

Math. Program., 1995

Sequence Independent Lifting of Cover Inequalities.

[BibT_eX]

[DOI]

Proceedings of the Integer Programming and Combinatorial Optimization, 1995

1994

One-machine generalized precedence constrained scheduling problems.

[BibT_eX]

[DOI]

Erick D. Wikum

Donna Crystal Llewellyn

Oper. Res. Lett., 1994

Lifted cover facets of the 0-1 knapsack polytope with GUB constraints.

[BibT_eX]

[DOI]

Pamela H. Vance

Oper. Res. Lett., 1994

MINTO, a mixed INTeger optimizer.

[BibT_eX]

[DOI]

Gabriele Sigismondi

Oper. Res. Lett., 1994

Some properties of the fleet assignment problem.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1994

The Age of Optimization: Solving Large-Scale Real-World Problems.

[BibT_eX]

[DOI]

Oper. Res., 1994

Solving binary cutting stock problems by column generation and branch-and-bound.

[BibT_eX]

[DOI]

Comput. Optim. Appl., 1994

1993

Experiments with parallel branch-and-bound algorithms for the set covering problem.

[BibT_eX]

[DOI]

Russell A. Rushmeier

Oper. Res. Lett., 1993

Min-cut clustering.

[BibT_eX]

[DOI]

Anuj Mehrotra

Math. Program., 1993

Formulating a Mixed Integer Programming Problem to Improve Solvability.

[BibT_eX]

[DOI]

Oper. Res., 1993

1992

Recent Developments and Future Directions in Mathematical Programming.

[BibT_eX]

[DOI]

IBM Syst. J., 1992

1991

A polyhedral approach to edge coloring.

[BibT_eX]

[DOI]

Sungsoo Park

Oper. Res. Lett., 1991

Some Facets for an Assignment Problem with Side Constraints.

[BibT_eX]

[DOI]

Ronny Aboudi

Oper. Res., 1991

1990

A Recursive Procedure to Generate All Cuts for 0-1 Mixed Integer Programs.

[BibT_eX]

[DOI]

Math. Program., 1990

1988

Integer and Combinatorial Optimization.

[BibT_eX]

[DOI]

Wiley interscience series in discrete mathematics and optimization, Wiley, ISBN: 978-1-118-62737-2, 1988

1986

Computational experience with a polynomial-time dual simplex algorithm for the transportation problem.

[BibT_eX]

[DOI]

Yoshiro Ikura

Discret. Appl. Math., 1986

1985

Simplex pivots on the set packing polytope.

[BibT_eX]

[DOI]

Yoshiro Ikura

Math. Program., 1985

1984

A polynomial algorithm for the max-cut problem on graphs without long odd cycles.

[BibT_eX]

[DOI]

Martin Grötschel

Math. Program., 1984

1982

R-domination on block graphs.

[BibT_eX]

[DOI]

Gerard J. Chang

Oper. Res. Lett., 1982

A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 1982

1981

Editorial.

[BibT_eX]

[DOI]

Oper. Res. Lett., 1981

An application of vertex packing to data analysis in the evaluation of pavement deterioration.

[BibT_eX]

[DOI]

Eliane A. Gattass

Oper. Res. Lett., 1981

A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles.

[BibT_eX]

[DOI]

Yoshiro Ikura

Math. Program., 1981

Algorithms for minimum covering by cliques and maximum clique in claw-free perfect graphs.

[BibT_eX]

[DOI]

Discret. Math., 1981

1980

A Canonical Representation of Simple Plant Location Problems and Its Applications.

[BibT_eX]

[DOI]

Gérard Cornuéjols

SIAM J. Algebraic Discret. Methods, 1980

Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem.

[BibT_eX]

[DOI]

Gérard Cornuéjols

Oper. Res., 1980

1979

Matroids and a Reliability Analysis Problem.

[BibT_eX]

[DOI]

Michael O. Ball

Math. Oper. Res., 1979

An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit.

[BibT_eX]

[DOI]

Marshall L. Fisher

Oper. Res., 1979

Easy and hard bottleneck location problems.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1979

1978

An analysis of approximations for maximizing submodular set functions - I.

[BibT_eX]

[DOI]

Marshall L. Fisher

Math. Program., 1978

Tight bounds for christofides' traveling salesman heuristic.

[BibT_eX]

[DOI]

Gérard Cornuéjols

Math. Program., 1978

Best Algorithms for Approximating the Maximum of a Submodular Set Function.

[BibT_eX]

[DOI]

Math. Oper. Res., 1978

1975

Vertex packings: Structural properties and algorithms.

[BibT_eX]

[DOI]

Leslie E. Trotter Jr.

Math. Program., 1975

When the Greedy Solution Solves a Class of Knapsack Problems.

[BibT_eX]

[DOI]

Michael J. Magazine

Leslie E. Trotter Jr.

Oper. Res., 1975

1974

Properties of vertex packing and independence system polyhedra.

[BibT_eX]

[DOI]

Leslie E. Trotter Jr.

Math. Program., 1974

Some inequalities on the chromatic number of a graph.

[BibT_eX]

[DOI]

T. King

Discret. Math., 1974

1973

Book reviews.

[BibT_eX]

[DOI]

Math. Program., 1973

1972

A Problem in Bulk Service Scheduling.

[BibT_eX]

[DOI]

P. L. Yu

Oper. Res., 1972

1971

A Modified Linear Program for Columnar Methods in Mathematical Programming.

[BibT_eX]

[DOI]

William B. Widhelm

Oper. Res., 1971

1969

The Set-Partitioning Problem: Set Covering with Equality Constraints.

[BibT_eX]

[DOI]

Robert S. Garfinkel

Oper. Res., 1969

1968

Letter to the Editor - A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem.

[BibT_eX]

[DOI]

Zev Ullmann

Oper. Res., 1968

The Traveling Salesman Problem: A Survey.

[BibT_eX]

[DOI]

Mandell Bellmore

Oper. Res., 1968

Computer construction of project networks.

[BibT_eX]

[DOI]

A. C. Fisher

J. S. Liebman

Commun. ACM, 1968

1967

A Transport Improvement Problem Transformable to a Best-Path Problem.

[BibT_eX]

[DOI]

Alan J. Goldman

Transp. Sci., 1967

1966

Scheduling to Minimize Interaction Cost.

[BibT_eX]

[DOI]

R. C. Carlson