| Publication | Date of Publication | Type |
|---|
An exact algorithm for the service network design problem with hub capacity constraints
Networks | 2023-12-12 | Paper |
A linear programming based approach to the Steiner tree problem with a fixed number of terminals
Networks | 2023-11-13 | Paper |
Decomposition of loosely coupled integer programs: a multiobjective perspective
Mathematical Programming. Series A. Series B | 2022-11-14 | Paper |
Sequence independent lifting of cover inequalities
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
Dynamic Discretization Discovery Algorithms for Time-Dependent Shortest Path Problems
INFORMS Journal on Computing | 2022-06-30 | Paper |
State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems
INFORMS Journal on Computing | 2022-06-28 | Paper |
Time-dependent shortest path problems with penalties and limits on waiting
INFORMS Journal on Computing | 2022-06-27 | Paper |
Decentralized online integer programming problems with a coupling cardinality constraint
Computers & Operations Research | 2022-03-09 | Paper |
Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
Discrete Optimization | 2021-01-15 | Paper |
| A Simulated Annealing Algorithm for the Directed Steiner Tree Problem | 2020-02-07 | Paper |
Tailoring parallel alternating criteria search for domain specific MIPs: application to maritime inventory routing
Computers & Operations Research | 2019-09-25 | Paper |
| A dynamic discretization discovery algorithm for the minimum duration time-dependent shortest path problem | 2018-11-21 | Paper |
A dual heuristic for mixed integer programming
Operations Research Letters | 2018-09-28 | Paper |
How important are branching decisions: fooling MIP solvers
Operations Research Letters | 2018-09-28 | Paper |
A parallel local search framework for the fixed-charge multicommodity network flow problem
Computers & Operations Research | 2018-07-11 | Paper |
Flexible solutions to maritime inventory routing problems with delivery time windows
Computers & Operations Research | 2018-07-11 | Paper |
Alternating criteria search: a parallel large neighborhood search algorithm for mixed integer programs
Computational Optimization and Applications | 2018-02-06 | Paper |
A hybrid primal heuristic for finding feasible solutions to mixed integer programs
European Journal of Operational Research | 2018-02-06 | Paper |
An abstract model for branching and its application to mixed integer programming
Mathematical Programming. Series A. Series B | 2017-12-01 | Paper |
Erratum to: ``An abstract model for branching and its application to mixed integer programming
Mathematical Programming. Series A. Series B | 2017-12-01 | Paper |
Comments on: ``On learning and branching: a survey
Top | 2017-10-12 | Paper |
A branch-and-price guided search approach to maritime inventory routing
Computers & Operations Research | 2017-01-05 | Paper |
Pricing for production and delivery flexibility in single-item lot-sizing
Computers & Operations Research | 2016-11-11 | Paper |
On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
SIAM Journal on Optimization | 2016-10-25 | Paper |
The fixed-charge shortest-path problem
INFORMS Journal on Computing | 2016-06-29 | Paper |
Scheduling and Routing of Fly-in Safari Planes Using a Flow-over-Flow Model
Facets of Combinatorial Optimization | 2015-07-22 | Paper |
Minimum concave cost flow over a grid network
Mathematical Programming. Series A. Series B | 2015-04-16 | Paper |
MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
European Journal of Operational Research | 2015-02-19 | Paper |
Two-Stage Decomposition Algorithms for Single Product Maritime Inventory Routing
INFORMS Journal on Computing | 2015-01-26 | Paper |
Restrict-and-relax search for 0-1 mixed-integer programs
EURO Journal on Computational Optimization | 2014-09-30 | Paper |
A cutting and scheduling problem in float glass manufacturing
Journal of Scheduling | 2014-08-18 | Paper |
Column generation for linear and integer programming
Documenta Mathematica | 2013-04-17 | Paper |
Branch-and-Price Guided Search
Lecture Notes in Computer Science | 2012-11-02 | Paper |
Mixed integer linear programming formulations for probabilistic constraints
Operations Research Letters | 2012-08-17 | Paper |
A lifted linear programming branch-and-bound algorithm for mixed-integer conic quadratic programs
INFORMS Journal on Computing | 2012-07-28 | Paper |
Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
Lifted tableaux inequalities for \(0\)-\(1\) mixed-integer programs: a computational study
INFORMS Journal on Computing | 2012-07-28 | Paper |
A note on ``A superior representation method for piecewise linear functions
INFORMS Journal on Computing | 2012-07-28 | Paper |
Dynamic programming-based column generation on time-expanded networks: application to the dial-a-flight problem
INFORMS Journal on Computing | 2012-07-28 | Paper |
Sell or hold: A simple two-stage stochastic combinatorial optimization problem
Operations Research Letters | 2012-07-12 | Paper |
The value function of an infinite-horizon single-item lot-sizing problem
Operations Research Letters | 2012-07-06 | Paper |
A branch-price-and-cut algorithm for single-product maritime inventory routing
Operations Research | 2012-06-18 | Paper |
Discrete dynamic programming and capital allocation
Management Science | 2012-02-12 | Paper |
A probabilistic comparison of split and type 1 triangle cuts for two-row mixed-integer programs
SIAM Journal on Optimization | 2012-01-09 | Paper |
Mixed-integer models for nonseparable piecewise-linear optimization: unifying framework and extensions
Operations Research | 2011-11-24 | Paper |
Strategic planning with start-time dependent variable costs
Operations Research | 2011-11-24 | Paper |
Modeling disjunctive constraints with a logarithmic number of binary variables and constraints
Mathematical Programming. Series A. Series B | 2011-06-17 | Paper |
Hooked on IP
Annals of Operations Research | 2011-05-20 | Paper |
Decomposing inventory routing problems with approximate value functions
Naval Research Logistics | 2011-01-06 | Paper |
Cutting planes for multistage stochastic integer programs
Operations Research | 2010-03-06 | Paper |
Information-based branching schemes for binary linear mixed integer problems
Mathematical Programming Computation | 2010-03-01 | Paper |
An integer programming approach for linear programs with probabilistic constraints
Mathematical Programming. Series A. Series B | 2010-02-19 | Paper |
Approximating the stability region for binary mixed-integer programs
Operations Research Letters | 2009-08-14 | Paper |
A Branch-and-Cut Algorithm Without Binary Variables for Nonconvex Piecewise Linear Optimization
Operations Research | 2009-08-13 | Paper |
George Dantzig's contributions to integer programming
Discrete Optimization | 2008-10-29 | Paper |
Nonconvex, lower semicontinuous piecewise linear optimization
Discrete Optimization | 2008-10-29 | Paper |
Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables and Constraints
Integer Programming and Combinatorial Optimization | 2008-06-10 | Paper |
An optimization approach for planning daily drayage operations
CEJOR. Central European Journal of Operations Research | 2008-05-27 | Paper |
Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements
Discrete Optimization | 2008-05-16 | Paper |
Sequential pairing of mixed integer inequalities
Discrete Optimization | 2008-02-22 | Paper |
An Integer Programming Approach for Linear Programs with Probabilistic Constraints
Integer Programming and Combinatorial Optimization | 2007-11-29 | Paper |
Sequential Pairing of Mixed Integer Inequalities
Integer Programming and Combinatorial Optimization | 2007-08-30 | Paper |
Improving airline operational performance through schedule perturbation
Annals of Operations Research | 2007-02-15 | Paper |
Analysis of bounds for a capacitated single-item lot-sizing problem
Computers & Operations Research | 2007-01-09 | Paper |
Short-term booking of air cargo space
European Journal of Operational Research | 2006-09-14 | Paper |
On formulations of the stochastic uncapacitated lot-sizing problem
Operations Research Letters | 2006-06-30 | Paper |
A branch-and-cut algorithm for the stochastic uncapacitated lot-sizing problem
Mathematical Programming. Series A. Series B | 2006-01-13 | Paper |
The 2-edge-connected subgraph polyhedron
Journal of Combinatorial Optimization | 2005-12-14 | Paper |
Facets of the Complementarity Knapsack Polytope
Mathematics of Operations Research | 2005-11-11 | Paper |
A Polyhedral Study of Integer Variable Upper Bounds
Mathematics of Operations Research | 2005-11-11 | Paper |
A polyhedral study of nonconvex quadratic programs with box constraints
Mathematical Programming. Series A. Series B | 2005-04-29 | Paper |
A branch-and-cut algorithm for nonconvex quadratic programs with box constraints
Mathematical Programming. Series A. Series B | 2005-04-29 | Paper |
| scientific article; zbMATH DE number 2159470 (Why is no real title available?) | 2005-04-19 | Paper |
| scientific article; zbMATH DE number 2086929 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2086920 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2084735 (Why is no real title available?) | 2004-08-09 | Paper |
Models for representing piecewise linear cost functions
Operations Research Letters | 2004-07-01 | Paper |
Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
Lifted inequalities for 0-1 mixed integer programming: superlinear lifting
Mathematical Programming. Series A. Series B | 2004-03-11 | Paper |
The mixed vertex packing problem.
Mathematical Programming. Series A. Series B | 2004-02-18 | Paper |
Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
INFORMS Journal on Computing | 2003-12-16 | Paper |
Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition
INFORMS Journal on Computing | 2003-11-06 | Paper |
On the polyhedral structure of a multi-item production planning model with setup times
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
A multi-item production planning model with setup times: algorithms, reformulations, and polyhedral characterizations for a special case
Mathematical Programming. Series A. Series B | 2003-10-29 | Paper |
A polyhedral study of the cardinality constrained knapsack problem
Mathematical Programming. Series A. Series B | 2003-08-20 | Paper |
| scientific article; zbMATH DE number 1953199 (Why is no real title available?) | 2003-07-25 | Paper |
Airline Crew Scheduling with Time Windows and Plane-Count Constraints
Transportation Science | 2003-06-29 | Paper |
A Stochastic Model of Airline Operations
Transportation Science | 2003-06-29 | Paper |
Dynamic network flow with uncertain arc capacities: Decomposition algorithm and computational results
Computational Optimization and Applications | 2003-04-22 | Paper |
The sample average approximation method applied to stochastic routing problems: a computational study
Computational Optimization and Applications | 2003-04-03 | Paper |
Price-Directed Control of Remnant Inventory Systems
Operations Research | 2002-11-05 | Paper |
Airline crew recovery
Transportation Science | 2002-10-17 | Paper |
A parallel primal-dual simplex algorithm
Operations Research Letters | 2002-07-22 | Paper |
An optimization based heuristic for political districting
Management Science | 2002-07-08 | Paper |
| scientific article; zbMATH DE number 1757964 (Why is no real title available?) | 2002-06-20 | Paper |
A Dynamic Network Flow Problem with Uncertain arc Capacities: Formulation and Problem Structure
Operations Research | 2002-06-04 | Paper |
Valid inequalities for problems with additive variable upper bounds
Mathematical Programming. Series A. Series B | 2002-05-27 | Paper |
Flight string models for aircraft fleeting and routing
Transportation Science | 2002-04-17 | Paper |
Solving large airline crew scheduling problems: Random pairing generation and strong branching
Computational Optimization and Applications | 2002-04-07 | Paper |
Branch-and-price: Column generation for solving huge integer programs
Operations Research | 2002-02-07 | Paper |
A family of inequalities for the generalized assignment polytope
Operations Research Letters | 2001-12-05 | Paper |
Sequence independent lifting in mixed integer programming
Journal of Combinatorial Optimization | 2001-07-19 | Paper |
A generalized assignment problem with special ordered sets: a polyhedral approach.
Mathematical Programming. Series A. Series B | 2001-07-02 | Paper |
Conflict graphs in solving integer programming problems
European Journal of Operational Research | 2001-05-02 | Paper |
The complexity of cover inequality separation
Operations Research Letters | 2001-04-02 | Paper |
Airline Crew Scheduling with Regularity
Transportation Science | 2001-01-01 | Paper |
Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables
The Knowledge Engineering Review | 2001-01-01 | Paper |
Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
Mathematical Programming. Series A. Series B | 2000-11-12 | Paper |
On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra
European Journal of Operational Research | 2000-09-14 | Paper |
| scientific article; zbMATH DE number 1416629 (Why is no real title available?) | 2000-03-19 | Paper |
The asymmetric traveling salesman problem with replenishment arcs
European Journal of Operational Research | 2000-01-01 | Paper |
| scientific article; zbMATH DE number 1342120 (Why is no real title available?) | 1999-11-21 | Paper |
Maximizing a submodular function by integer programming: Polyhedral results for the quadratic case
European Journal of Operational Research | 1999-04-27 | Paper |
Polyhedral characterizations and perfection of line graphs
Discrete Applied Mathematics | 1998-12-10 | Paper |
Airline Crew Scheduling: A New Formulation and Decomposition Algorithm
Operations Research | 1997-11-25 | Paper |
Maintenance and Crew Considerations in Fleet Assignment
Transportation Science | 1997-10-30 | Paper |
The aircraft rotation problem
Annals of Operations Research | 1997-06-16 | Paper |
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
Journal of Heuristics | 1996-09-01 | Paper |
The fleet assignment problem: Solving a large scale integer program
Mathematical Programming. Series A. Series B | 1996-02-06 | Paper |
Lifted cover facets of the 0-1 knapsack polytope with GUB constraints
Operations Research Letters | 1995-06-25 | Paper |
Recent developments and future directions in mathematical programming
IBM Systems Journal | 1995-02-20 | Paper |
MINTO, a Mixed INTeger Optimizer
Operations Research Letters | 1995-02-19 | Paper |
Some properties of the fleet assignment problem
Operations Research Letters | 1994-09-05 | Paper |
Experiments with parallel branch-and-bound algorithms for the set covering problem
Operations Research Letters | 1994-06-26 | Paper |
Solving binary cutting stock problems by column generation and branch- and-bound
Computational Optimization and Applications | 1994-05-18 | Paper |
Min-cut clustering
Mathematical Programming. Series A. Series B | 1994-04-28 | Paper |
The Age of Optimization: Solving Large-Scale Real-World Problems
Operations Research | 1994-04-12 | Paper |
Formulating a Mixed Integer Programming Problem to Improve Solvability
Operations Research | 1994-03-13 | Paper |
| scientific article; zbMATH DE number 218797 (Why is no real title available?) | 1993-08-11 | Paper |
| scientific article; zbMATH DE number 193411 (Why is no real title available?) | 1993-06-05 | Paper |
| scientific article; zbMATH DE number 176470 (Why is no real title available?) | 1993-05-18 | Paper |
A Characterization of Lifted-Cover Facets of Knapsack Polytope with GUB Constraints
Combinatorial Optimization | 1993-05-18 | Paper |
A Strong Cutting Plane/Branch-and-Bound Algorithm for Node Packing
The Journal of the Operational Research Society | 1993-01-16 | Paper |
A polyhedral approach to edge coloring
Operations Research Letters | 1992-06-27 | Paper |
A recursive procedure to generate all cuts for 0-1 mixed integer programs
Mathematical Programming. Series A. Series B | 1992-06-25 | Paper |
Some Facets for an Assignment Problem with Side Constraints
Operations Research | 1992-06-25 | Paper |
| scientific article; zbMATH DE number 4202014 (Why is no real title available?) | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4181140 (Why is no real title available?) | 1990-01-01 | Paper |
Branch-and-bound and parallel computation: A historical note
Operations Research Letters | 1988-01-01 | Paper |
Computational experience with a polynomial-time dual simplex algorithm for the transportation problem
Discrete Applied Mathematics | 1986-01-01 | Paper |
Covering, Packing and Generalized Perfection
SIAM Journal on Algebraic Discrete Methods | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3930720 (Why is no real title available?) | 1985-01-01 | Paper |
Simplex pivots on the set packing polytope
Mathematical Programming | 1985-01-01 | Paper |
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
SIAM Journal on Algebraic Discrete Methods | 1984-01-01 | Paper |
A polynomial algorithm for the max-cut problem on graphs without long odd cycles
Mathematical Programming | 1984-01-01 | Paper |
An Efficient Primal Simplex Algorithm for Maximum Weighted Vertex Packing on Bipartite Graphs
North-Holland Mathematics Studies | 1982-01-01 | Paper |
R-domination of block graphs
Operations Research Letters | 1982-01-01 | Paper |
Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
North-Holland Mathematics Studies | 1981-01-01 | Paper |
An application of vertex packing to data analysis in the evaluation of pavement deterioration
Operations Research Letters | 1981-01-01 | Paper |
A Canonical Representation of Simple Plant Location Problems and Its Applications
SIAM Journal on Algebraic Discrete Methods | 1980-01-01 | Paper |
Worst-Case and Probabilistic Analysis of Algorithms for a Location Problem
Operations Research | 1980-01-01 | Paper |
An Analysis of Approximations for Finding a Maximum Weight Hamiltonian Circuit
Operations Research | 1979-01-01 | Paper |
Matroids and a Reliability Analysis Problem
Mathematics of Operations Research | 1979-01-01 | Paper |
Optimal set partitioning, matchings and lagrangian duality
Naval Research Logistics Quarterly | 1979-01-01 | Paper |
Note—On “Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms”
Management Science | 1979-01-01 | Paper |
Best Algorithms for Approximating the Maximum of a Submodular Set Function
Mathematics of Operations Research | 1978-01-01 | Paper |
| scientific article; zbMATH DE number 3635849 (Why is no real title available?) | 1978-01-01 | Paper |
An analysis of approximations for maximizing submodular set functions—I
Mathematical Programming | 1978-01-01 | Paper |
Tight bounds for christofides' traveling salesman heuristic
Mathematical Programming | 1978-01-01 | Paper |
Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
Management Science | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3559283 (Why is no real title available?) | 1977-01-01 | Paper |
| scientific article; zbMATH DE number 3523310 (Why is no real title available?) | 1976-01-01 | Paper |
Vertex packings: Structural properties and algorithms
Mathematical Programming | 1975-01-01 | Paper |
When the Greedy Solution Solves a Class of Knapsack Problems
Operations Research | 1975-01-01 | Paper |
Properties of vertex packing and independence system polyhedra
Mathematical Programming | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3550465 (Why is no real title available?) | 1974-01-01 | Paper |
Set Partitioning and Chain Decomposition
Management Science | 1974-01-01 | Paper |
| scientific article; zbMATH DE number 3427118 (Why is no real title available?) | 1973-01-01 | Paper |
| scientific article; zbMATH DE number 3410784 (Why is no real title available?) | 1972-01-01 | Paper |
A generalized permanent label setting algorithm for the shortest path between specified nodes
Journal of Mathematical Analysis and Applications | 1972-01-01 | Paper |
A Modified Linear Program for Columnar Methods in Mathematical Programming
Operations Research | 1971-01-01 | Paper |
Optimal Political Districting by Implicit Enumeration Techniques
Management Science | 1970-01-01 | Paper |
A finiteness proof for modified dantzig cuts in integer programming
Naval Research Logistics Quarterly | 1970-01-01 | Paper |
The Set-Partitioning Problem: Set Covering with Equality Constraints
Operations Research | 1969-01-01 | Paper |
A decomposable transshipment algorithm for a multiperiod transportation problem
Naval Research Logistics Quarterly | 1969-01-01 | Paper |
The Traveling Salesman Problem: A Survey
Operations Research | 1968-01-01 | Paper |
Letter to the Editor—A Note on the Generalized Lagrange Multiplier Solution to an Integer Programming Problem
Operations Research | 1968-01-01 | Paper |
Optimal capacity expansion
Naval Research Logistics Quarterly | 1968-01-01 | Paper |
Scheduling to Minimize Interaction Cost
Operations Research | 1966-01-01 | Paper |
An Algorithm for the Line Balancing Problem
Management Science | 1964-01-01 | Paper |
Decomposition of linear programs by dynamic programming
Naval Research Logistics Quarterly | 1964-01-01 | Paper |
A Geometric Model and a Graphical Algorithm for a Sequencing Problem
Operations Research | 1963-01-01 | Paper |
On the Relation Between the Traveling-Salesman and the Longest-Path Problems
Operations Research | 1962-01-01 | Paper |
Letter to the Editor—A Short Table of z-Transforms and Generating Functions
Operations Research | 1961-01-01 | Paper |
