H. Edwin Romeijn

According to our database1, H. Edwin Romeijn authored at least 68 papers between 1991 and 2018.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


Approximation Algorithms for a Class of Stochastic Selection Problems with Reward and Cost Considerations.
Oper. Res., 2018

Simplex Algorithm for Countable-State Discounted Markov Decision Processes.
Oper. Res., 2017

Improving the efficiency of decentralized supply chains with fixed ordering costs.
Eur. J. Oper. Res., 2016

The economic lot-sizing problem with perishable items and consumption order preference.
Eur. J. Oper. Res., 2015

Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space.
Oper. Res. Lett., 2014

A fluence map optimization model for restoring traditional fractionation in IMRT treatment planning.
Optim. Lett., 2014

Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand.
INFORMS J. Comput., 2014

The static stochastic knapsack problem with normally distributed item sizes.
Math. Program., 2012

Integrated market selection and production planning: complexity and solution approaches.
Math. Program., 2012

Quantifying the Trade-off Between IMRT Treatment Plan Quality and Delivery Efficiency Using Direct Aperture Optimization.
INFORMS J. Comput., 2012

An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy.
INFORMS J. Comput., 2012

A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand.
J. Heuristics, 2012

An efficient approach to incorporating interfraction motion in IMRT treatment planning.
Comput. Oper. Res., 2012

Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures.
Ann. Oper. Res., 2012

A class of nonlinear nonseparable continuous knapsack and multiple-choice knapsack problems.
Math. Program., 2011

Approximation algorithms for supply chain planning and logistics problems with market choice.
Math. Program., 2011

The stochastic transportation problem with single sourcing.
Eur. J. Oper. Res., 2011

Integrating facility location and production planning decisions.
Networks, 2010

Optimal Multileaf Collimator Leaf Sequencing in IMRT Treatment Planning.
Oper. Res., 2010

Supply capacity acquisition and allocation with uncertain customer demands.
Eur. J. Oper. Res., 2010

Greedy approaches for a class of nonlinear Generalized Assignment Problems.
Discret. Appl. Math., 2010

Random Search Methods.
Proceedings of the Encyclopedia of Optimization, Second Edition, 2009

A Response Surface Approach to Beam Orientation Optimization in Intensity-Modulated Radiation Therapy Treatment Planning.
INFORMS J. Comput., 2009

Capacitated procurement planning with price-sensitive demand and general concave-revenue functions.
Eur. J. Oper. Res., 2009

The generalized assignment problem with flexible jobs.
Discret. Appl. Math., 2009

Decision support for optimal adaptation of product and supply chain systems based on real options theory.
Proceedings of the IEEE Conference on Automation Science and Engineering, 2009

Allocating procurement to capacitated suppliers with concave quantity discounts.
Oper. Res. Lett., 2008

Simplex-inspired algorithms for solving a class of convex programming problems.
Optim. Lett., 2008

A simplex algorithm for minimum-cost network-flow problems in infinite networks.
Networks, 2008

Market selection decisions for inventory models with price-sensitive demand.
J. Glob. Optim., 2008

Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning.
J. Glob. Optim., 2008

Introduction to the Special Issue on Operations Research in Health Care.
Oper. Res., 2008

Target market selection and marketing effort under uncertainty: The selective newsvendor.
Eur. J. Oper. Res., 2008

Lot-sizing with non-stationary cumulative capacities.
Oper. Res. Lett., 2007

On a nonseparable convex maximization problem with continuous knapsack constraints.
Oper. Res. Lett., 2007

Manufacturing delivery performance for supply chain management.
Math. Comput. Model., 2007

A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints.
INFORMS J. Comput., 2007

Designing two-echelon supply networks.
Eur. J. Oper. Res., 2007

Extreme point characterizations for infinite network flow problems.
Networks, 2006

Call for Papers: Special Issue on <i>Operations Research in Health Care</i>.
Oper. Res., 2006

A New Linear Programming Approach to Radiation Therapy Treatment Planning Problems.
Oper. Res., 2006

Requirements Planning with Pricing and Order Selection Flexibility.
Oper. Res., 2006

Generation of classes of robust periodic railway timetables.
Comput. Oper. Res., 2006

Cross-facility management of production and transportation planning problem.
Comput. Oper. Res., 2006

On solving the multi-period single-sourcing problem under uncertainty.
Comput. Manag. Sci., 2006

A Column Generation Approach to Radiation Therapy Treatment Planning Using Aperture Modulation.
SIAM J. Optim., 2005

Integrated Lot Sizing in Serial Supply Chains with Production Capacities.
Manag. Sci., 2005

An Integrated Inventory-Routing System for Multi-item Joint Replenishment with Limited Vehicle Capacity.
J. Glob. Optim., 2005

Optimising Noisy Objective Functions.
J. Glob. Optim., 2005

Approximate Implementations of Pure Random Search in the Presence of Noise.
J. Glob. Optim., 2005

Inventory and Facility Location Models with Market Selection.
Proceedings of the Integer Programming and Combinatorial Optimization, 2005

Asymptotic Analysis of a Greedy Heuristic for the Multi-Period Single-Sourcing Problem: The Acyclic Case.
J. Heuristics, 2004

A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem.
Oper. Res., 2003

Implementing pure adaptive search for global optimization using Markov chain sampling.
J. Glob. Optim., 2001

Generating Experimental Data for the Generalized Assignment Problem.
Oper. Res., 2001

A probabilistic analysis of the multi-period single-sourcing problem.
Discret. Appl. Math., 2001

A Probabilistic Feasibility and Value Analysis of the Generalized Assignment Problem.
J. Comb. Optim., 2000

A class of greedy algorithms for the generalized assignment problem.
Discret. Appl. Math., 2000

Parallel algorithms for solving aggregated shortest-path problems.
Comput. Oper. Res., 1999

Shadow Prices in Infinite-Dimensional Linear Programming.
Math. Oper. Res., 1998

Approximating Extreme Points of Infinite Dimensional Convex Sets.
Math. Oper. Res., 1998

Approximating Shortest Paths in Large-Scale Networks with an Application to Intelligent Transportation Systems.
INFORMS J. Comput., 1998

Routing Trains Through Railway Stations: Model Formulation and Algorithms.
Transp. Sci., 1996

Simulated annealing for constrained global optimization.
J. Glob. Optim., 1994

Hit-and-Run Algorithms for Generating Multivariate Distributions.
Math. Oper. Res., 1993

Improving Hit-and-Run for global optimization.
J. Glob. Optim., 1993

Duality in infinite dimensional linear programming.
Math. Program., 1992

Shake-and-Bake Algorithms for Generating Uniform Points on the Boundary of Bounded Polyhedra.
Oper. Res., 1991