| Publication | Date of Publication | Type |
|---|
The price of anarchy in loss systems
Naval Research Logistics | 2023-10-18 | Paper |
Stable matching of student-groups to dormitories
European Journal of Operational Research | 2022-05-20 | Paper |
Ticket queues with regular and strategic customers
Queueing Systems | 2020-11-08 | Paper |
Full characterization of the nonnegative core of some cooperative games
Naval Research Logistics | 2019-05-02 | Paper |
Subadditive and homogeneous of degree one games are totally balanced
Operations Research | 2014-11-26 | Paper |
The uncapacitated swapping problem on a line and on a circle
Discrete Applied Mathematics | 2013-03-12 | Paper |
The preemptive swapping problem on a tree
Networks | 2011-11-21 | Paper |
Cooperation in service systems
Operations Research | 2011-11-17 | Paper |
The Cost Allocation Problem for the First Order Interaction Joint Replenishment Model
Operations Research | 2009-08-13 | Paper |
An Optimal Lot-Sizing and Offline Inspection Policy in the Case of Nonrigid Demand
Operations Research | 2009-08-13 | Paper |
Optimal Lot Sizes with Geometric Production Yield and Rigid Demand
Operations Research | 2009-07-03 | Paper |
Multi-item lot-sizing with joint set-up costs
Mathematical Programming. Series A. Series B | 2009-04-24 | Paper |
Algorithms for the multi-item multi-vehicles dynamic lot sizing problem
Naval Research Logistics | 2007-02-20 | Paper |
Lot-sizing two-echelon assembly systems with random yields and rigid demand
European Journal of Operational Research | 2006-06-30 | Paper |
A probabilistic analysis of a fixed partition policy for the inventory-routing problem
Naval Research Logistics | 2005-02-22 | Paper |
An asymptotic 98.5\%-effective lower bound on fixed partition policies for the inventory-routing problem
Discrete Applied Mathematics | 2005-01-31 | Paper |
Periodic Scheduling with Service Constraints
Operations Research | 2002-06-04 | Paper |
| Approximation algorithms for the capacitated traveling salesman problem with pickups and deliveries | 2000-07-27 | Paper |
The Swapping Problem on a Line
SIAM Journal on Computing | 1999-10-28 | Paper |
Scheduling maintenance services to three machines
Annals of Operations Research | 1999-06-10 | Paper |
| scientific article; zbMATH DE number 1501026 (Why is no real title available?) | 1999-01-01 | Paper |
A \(\frac{5}{3}\)-approximation algorithm for the clusterd traveling salesman tour and path problems
Operations Research Letters | 1999-01-01 | Paper |
The scheduling of maintenance service
Discrete Applied Mathematics | 1998-04-13 | Paper |
| The vehicle-routing problem with delivery and back-haul options | 1996-10-03 | Paper |
The general multi-retailer EOQ problem with vehicle routing costs
European Journal of Operational Research | 1995-05-30 | Paper |
The traveling salesman problem with delivery and backhauls
Operations Research Letters | 1995-01-11 | Paper |
Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures
Operations Research | 1994-09-20 | Paper |
Two-Echelon Distribution Systems with Vehicle Routing Costs and Central Inventories
Operations Research | 1993-08-09 | Paper |
The swapping problem
Networks | 1993-01-16 | Paper |
Structured Partitioning Problems
Operations Research | 1992-06-26 | Paper |
Multi-Item Replenishment and Storage Problem (MIRSP): Heuristics and Bounds
Operations Research | 1991-01-01 | Paper |
Capacitated Two-Stage Multi-Item Production/Inventory Model with Joint Setup Costs
Operations Research | 1991-01-01 | Paper |
One Warehouse Multiple Retailer Systems with Vehicle Routing Costs
Management Science | 1990-01-01 | Paper |
A Class of Euclidean Routing Problems with General Route Cost Functions
Mathematics of Operations Research | 1990-01-01 | Paper |
Ranking the Best Binary Trees
SIAM Journal on Computing | 1989-01-01 | Paper |
Simulated annealing methods with general acceptance probabilities
Journal of Applied Probability | 1987-01-01 | Paper |
Ergodicity in Parametric Nonstationary Markov Chains: An Application to Simulated Annealing Methods
Operations Research | 1987-01-01 | Paper |
