| Publication | Date of Publication | Type |
|---|
| Approximation schemes for minimizing average weighted completion time with release dates | 2026-05-06 | Paper |
Performance of the offer-everything policy
Operations Research | 2026-02-18 | Paper |
Cost‐raising internalization in supply chain design
Naval Research Logistics | 2023-10-17 | Paper |
Faster algorithms for next breakpoint and max value for parametric global minimum cuts
Integer Programming and Combinatorial Optimization | 2022-10-14 | Paper |
Scheduling unit jobs with compatible release dates on parallel machines with nonstationary speeds
Integer Programming and Combinatorial Optimization | 2022-08-30 | Paper |
| Appointment scheduling with discrete random durations | 2019-05-06 | Paper |
Efficiency of equilibria in restricted uniform machine scheduling with total weighted completion time as social cost
Naval Research Logistics | 2019-03-05 | Paper |
Combinatorial approach to inference in partially identified incomplete structural models
Quantitative Economics | 2018-09-12 | Paper |
Optimum turn-restricted paths, nested compatibility, and optimum convex polygons
Journal of Combinatorial Optimization | 2018-07-26 | Paper |
Largest minimal inversion-complete and pair-complete sets of permutations
Combinatorica | 2018-04-27 | Paper |
A study of the Bienstock-Zuckerberg algorithm: applications in mining and resource constrained project scheduling
Computational Optimization and Applications | 2018-04-20 | Paper |
Tight MIP formulations for bounded up/down times and interval-dependent start-ups
Mathematical Programming. Series A. Series B | 2017-07-21 | Paper |
Carathéodory, Helly, and Radon Numbers for Sublattice and Related Convexities
Mathematics of Operations Research | 2017-06-02 | Paper |
Optimal pits and optimal transportation
ESAIM: Mathematical Modelling and Numerical Analysis | 2016-01-07 | Paper |
Strongly polynomial bounds for multiobjective and parametric global minimum cuts in graphs and hypergraphs
Mathematical Programming. Series A. Series B | 2015-12-09 | Paper |
A Strongly Polynomial Time Algorithm for Multicriteria Global Minimum Cuts
Integer Programming and Combinatorial Optimization | 2014-06-02 | Paper |
Integer preemptive scheduling on parallel machines
Operations Research Letters | 2013-03-05 | Paper |
Technical Note—A Sampling-Based Approach to Appointment Scheduling
Operations Research | 2012-11-08 | Paper |
Structural and algorithmic properties for parametric minimum cuts
Mathematical Programming. Series A. Series B | 2012-10-15 | Paper |
Rational generating functions and integer programming games
Operations Research | 2012-06-26 | Paper |
The interval ordering problem
Discrete Applied Mathematics | 2012-05-30 | Paper |
Appointment scheduling with discrete random durations
Mathematics of Operations Research | 2012-05-24 | Paper |
| Structural properties of optimal schedules with preemption | 2012-02-10 | Paper |
Toward Robust Revenue Management: Competitive Analysis of Online Booking
Operations Research | 2011-11-24 | Paper |
Clique partitioning of interval graphs with submodular costs on the cliques
RAIRO - Operations Research | 2011-06-01 | Paper |
Clique partitioning of interval graphs with submodular costs on the cliques
RAIRO - Operations Research | 2011-06-01 | Paper |
Properties of optimal schedules in preemptive shop scheduling
Discrete Applied Mathematics | 2011-03-10 | Paper |
| Production planning | 2011-01-03 | Paper |
Minimizing the sum of weighted completion times in a concurrent open shop
Operations Research Letters | 2010-12-20 | Paper |
Parametric integer programming algorithm for bilevel mixed integer programs
Journal of Optimization Theory and Applications | 2010-10-27 | Paper |
Separation, dimension, and facet algorithms for node flow polyhedra
Mathematical Programming. Series A. Series B | 2010-09-16 | Paper |
Minimizing the number of machines for minimum length schedules
European Journal of Operational Research | 2009-12-07 | Paper |
Integrality Property in Preemptive Parallel Machine Scheduling
Computer Science - Theory and Applications | 2009-08-18 | Paper |
Dynamic Multipriority Patient Scheduling for a Diagnostic Resource
Operations Research | 2009-08-13 | Paper |
On the Asymptotic Optimality of a Simple On-Line Algorithm for the Stochastic Single-Machine Weighted Completion Time Problem and Its Extensions
Operations Research | 2009-08-13 | Paper |
Decompositions, Network Flows, and a Precedence Constrained Single-Machine Scheduling Problem
Operations Research | 2009-07-09 | Paper |
Production and Inventory Model Using Net Present Value
Operations Research | 2009-07-03 | Paper |
Batch processing with interval graph compatibilities between tasks
Discrete Applied Mathematics | 2008-03-18 | Paper |
Sublattices of product spaces: Hulls, representations and counting
Discrete Mathematics | 2008-03-13 | Paper |
Approximation algorithms for shop scheduling problems with minsum objective: A correction
Journal of Scheduling | 2007-05-15 | Paper |
Approximation Bounds for a General Class of Precedence Constrained Parallel Machine Scheduling Problems
SIAM Journal on Computing | 2006-06-01 | Paper |
The asymptotic performance ratio of an on-line algorithm for uniform parallel machine scheduling with release dates
Mathematical Programming. Series A. Series B | 2006-05-02 | Paper |
Bimonotone linear inequalities and sublattices of \(\mathbb R^n\)
Linear Algebra and its Applications | 2006-03-16 | Paper |
On the asymptotic optimality of algorithms for the flow shop problem with release dates
Naval Research Logistics | 2005-06-01 | Paper |
Minimizing a Convex Cost Closure Set
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
A (2+ε)-approximation algorithm for the generalized preemptive open shop problem with minsum objective
Journal of Algorithms | 2003-05-14 | Paper |
Approximation algorithms for shop scheduling problems with minsum objective
Journal of Scheduling | 2002-08-08 | Paper |
| scientific article; zbMATH DE number 1757967 (Why is no real title available?) | 2002-06-20 | Paper |
| scientific article; zbMATH DE number 1757946 (Why is no real title available?) | 2002-06-20 | Paper |
Single machine scheduling with release dates
SIAM Journal on Discrete Mathematics | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1670664 (Why is no real title available?) | 2001-12-18 | Paper |
A general class of greedily solvable linear programs
Mathematics of Operations Research | 2001-11-26 | Paper |
| scientific article; zbMATH DE number 1445389 (Why is no real title available?) | 2001-01-15 | Paper |
| scientific article; zbMATH DE number 1342132 (Why is no real title available?) | 2000-11-27 | Paper |
Minimizing symmetric submodular functions
Mathematical Programming. Series A. Series B | 1999-06-28 | Paper |
| scientific article; zbMATH DE number 1263283 (Why is no real title available?) | 1999-03-16 | Paper |
| scientific article; zbMATH DE number 1187165 (Why is no real title available?) | 1998-08-10 | Paper |
Approximation algorithms for multi-index transportation problems with decomposable costs
Discrete Applied Mathematics | 1998-03-04 | Paper |
Single Resource Multi-Item Inventory Systems
Operations Research | 1997-07-06 | Paper |
On the Two-Level Uncapacitated Facility Location Problem
INFORMS Journal on Computing | 1997-06-10 | Paper |
An Exact Algorithm for Maximum Entropy Sampling
Operations Research | 1997-03-11 | Paper |
| scientific article; zbMATH DE number 913348 (Why is no real title available?) | 1996-08-05 | Paper |
| A feedback strategy for periodic network flows | 1996-08-05 | Paper |
| scientific article; zbMATH DE number 910864 (Why is no real title available?) | 1996-07-28 | Paper |
Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes
Mathematics of Operations Research | 1996-06-09 | Paper |
Ladders for Travelling Salesmen
SIAM Journal on Optimization | 1996-04-01 | Paper |
Symmetric Inequalities and Their Composition for Asymmetric Travelling Salesman Polytopes
Mathematics of Operations Research | 1996-02-25 | Paper |
The performance ratio of grouping policies for the joint replenishment problem
Discrete Applied Mathematics | 1994-01-02 | Paper |
Structure of a simple scheduling polyhedron
Mathematical Programming. Series A. Series B | 1993-06-29 | Paper |
Hamiltonian path and symmetric travelling salesman polytopes
Mathematical Programming. Series A. Series B | 1993-06-29 | Paper |
Simple Power-of-Two Policies are Close to Optimal in a General Class of Production/Distribution Networks with General Joint Setup Costs
Mathematics of Operations Research | 1993-03-01 | Paper |
On the convex hull of feasible solutions to certain combinatorial problems
Operations Research Letters | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 31719 (Why is no real title available?) | 1992-06-28 | Paper |
Lot Sizing Policies for Finite Production Rate Assembly Systems
Operations Research | 1992-06-28 | Paper |
Single-Machine Scheduling Polyhedra with Precedence Constraints
Mathematics of Operations Research | 1992-06-25 | Paper |
Cut-threshold graphs
Discrete Applied Mathematics | 1991-01-01 | Paper |
Comment on “A Dynamic Programming Algorithm for Joint Replenishment Under General Order Cost Functions”
Management Science | 1987-01-01 | Paper |
| scientific article; zbMATH DE number 4008089 (Why is no real title available?) | 1986-01-01 | Paper |
Performance ratio of polynomial heuristics for triangle inequality quadratic assignment problems
Operations Research Letters | 1986-01-01 | Paper |
Bounds for Assembly Line Balancing Heuristics
Operations Research | 1985-01-01 | Paper |
| scientific article; zbMATH DE number 3906193 (Why is no real title available?) | 1984-01-01 | Paper |
On finding the K best cuts in a network
Operations Research Letters | 1984-01-01 | Paper |
On Dynamic Programming Methods for Assembly Line Balancing
Operations Research | 1982-01-01 | Paper |
Selected Applications of Minimum Cuts in Networks
INFOR: Information Systems and Operational Research | 1982-01-01 | Paper |
A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
Networks | 1982-01-01 | Paper |
On the One-Dimensional Space Allocation Problem
Operations Research | 1981-01-01 | Paper |
The travelling salesman problem as a constrained shortest path problem: Theory and computational experience
Opsearch | 1980-01-01 | Paper |
On the structure of all minimum cuts in a network and applications
Mathematical Programming Studies | 1980-01-01 | Paper |
Theoretical Efficiency of the Algorithm “Capacity” for the Maximum Flow Problem
Mathematics of Operations Research | 1980-01-01 | Paper |
The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling
Operations Research | 1978-01-01 | Paper |
On the integer-valued variables in the linear vertex packing problem
Mathematical Programming | 1977-01-01 | Paper |
