The following pages link to H. Edwin Romeijn (Q200434):
Displayed 50 items.
- The economic lot-sizing problem with perishable items and consumption order preference (Q319481) (← links)
- Improving the efficiency of decentralized supply chains with fixed ordering costs (Q322983) (← links)
- A facility neighborhood search heuristic for capacitated facility location with single-source constraints and flexible demand (Q519091) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- Approximation algorithms for supply chain planning and logistics problems with market choice (Q647392) (← links)
- Integrated market selection and production planning: complexity and solution approaches (Q715060) (← links)
- The static stochastic knapsack problem with normally distributed item sizes (Q715062) (← links)
- Optimising noisy objective functions (Q813361) (← links)
- Approximate implementations of pure random search in the presence of noise (Q813364) (← links)
- Designing two-echelon supply networks (Q859921) (← links)
- Allocating procurement to capacitated suppliers with concave quantity discounts (Q924901) (← links)
- On solving the multi-period single-sourcing problem under uncertainty (Q926314) (← links)
- Market selection decisions for inventory models with price-sensitive demand (Q934809) (← links)
- Simplex-inspired algorithms for solving a class of convex programming problems (Q941039) (← links)
- Greedy approaches for a class of nonlinear generalized assignment problems (Q968176) (← links)
- Intensity modulated radiation therapy treatment plan optimization. With comments and rejoinder (Q1001358) (← links)
- Capacitated procurement planning with price-sensitive demand and general concave-revenue functions (Q1002053) (← links)
- The generalized assignment problem with flexible jobs (Q1003754) (← links)
- Neighborhood search approaches to beam orientation optimization in intensity modulated radiation therapy treatment planning (Q1016076) (← links)
- Duality in infinite dimensional linear programming (Q1184338) (← links)
- Routing trains through railway stations: Complexity issues (Q1278725) (← links)
- New reflection generator for simulated annealing in mixed-integer/continuous global optimization (Q1291825) (← links)
- Parallel algorithms for solving aggregated shortest-path problems (Q1304488) (← links)
- Simulated annealing for constrained global optimization (Q1337127) (← links)
- A class of greedy algorithms for the generalized assignment problem (Q1570837) (← links)
- A probabilistic feasibility and value analysis of the generalized assignment problem (Q1587589) (← links)
- Recent developments and trends in global optimization (Q1593827) (← links)
- Mixed-integer programming techniques for decomposing IMRT fluence maps using rectangular apertures (Q1761855) (← links)
- Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space (Q1785223) (← links)
- Asymptotic analysis of a greedy heuristic for the multi-period single-sourcing problem: The acyclic case (Q1826488) (← links)
- The stochastic transportation problem with single sourcing (Q2275818) (← links)
- Improving hit-and-run for global optimization (Q2366968) (← links)
- Two-echelon requirements planning with pricing decisions (Q2379819) (← links)
- A fluence map optimization model for restoring traditional fractionation in IMRT treatment planning (Q2448213) (← links)
- Lot-sizing with non-stationary cumulative capacities (Q2457275) (← links)
- Capacitated requirements planning with pricing flexibility and general cost and revenue functions (Q2468882) (← links)
- Manufacturing delivery performance for supply chain management (Q2471600) (← links)
- Target market selection and marketing effort under uncertainty: the selective newsvendor (Q2482780) (← links)
- Generation of classes of robust periodic railway timetables (Q2489288) (← links)
- Cross-facility management of production and transportation planning problem (Q2499157) (← links)
- An integrated inventory-routing system for multi-item joint replenishment with limited vehicle capacity (Q2569152) (← links)
- On a nonseparable convex maximization problem with continuous Knapsack constraints (Q2643790) (← links)
- Supply capacity acquisition and allocation with uncertain customer demands (Q2655615) (← links)
- Shadow Prices in Infinite-Dimensional Linear Programming (Q2757532) (← links)
- Approximating Extreme Points of Infinite Dimensional Convex Sets (Q2757544) (← links)
- An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy (Q2815444) (← links)
- Quantifying the Trade-off Between IMRT Treatment Plan Quality and Delivery Efficiency Using Direct Aperture Optimization (Q2815465) (← links)
- A Heuristic Approach to the Multi-Period Single-Sourcing Problem with Production and Inventory Capacities and Perishability Constraints (Q2892307) (← links)
- Resource-Constrained Assignment Problems with Shared Resource Consumption and Flexible Demand (Q2962557) (← links)
- Integrating facility location and production planning decisions (Q3057133) (← links)