Research Article

Single-Machine Scheduling Problems with Generalized Preemption

Pages:1–12

Published Online:July 7, 2008

https://doi.org/10.1287/ijoc.1080.0273

Exact and Asymptotically Exact Solutions for a Class of Assortment Problems

Pages:13–25

Published Online:June 20, 2008

https://doi.org/10.1287/ijoc.1080.0274

Advanced Scatter Search for the Max-Cut Problem

Pages:26–38

Published Online:August 8, 2008

https://doi.org/10.1287/ijoc.1080.0275

Pareto Optima of Multicriteria Integer Linear Programs

Pages:39–48

Published Online:September 5, 2008

https://doi.org/10.1287/ijoc.1080.0277

An Optimal Constrained Pruning Strategy for Decision Trees

Pages:49–61

Published Online:August 8, 2008

https://doi.org/10.1287/ijoc.1080.0278

A Response Surface Approach to Beam Orientation Optimization in Intensity-Modulated Radiation Therapy Treatment Planning

Pages:62–76

Published Online:August 20, 2008

https://doi.org/10.1287/ijoc.1080.0279

Minimax Regret Single-Facility Ordered Median Location Problems on Networks

Pages:77–87

Published Online:August 8, 2008

https://doi.org/10.1287/ijoc.1080.0280

Efficient Correlation Matching for Fitting Discrete Multivariate Distributions with Arbitrary Marginals and Normal-Copula Dependence

Pages:88–106

Published Online:August 20, 2008

https://doi.org/10.1287/ijoc.1080.0281

Extending Algebraic Modelling Languages for Stochastic Programming

Pages:107–122

Published Online:September 15, 2008

https://doi.org/10.1287/ijoc.1080.0282

Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints

Pages:123–136

Published Online:September 5, 2008

https://doi.org/10.1287/ijoc.1080.0283

Linear-Programming-Based Lifting and Its Application to Primal Cutting-Plane Algorithms

Pages:137–150

Published Online:September 15, 2008

https://doi.org/10.1287/ijoc.1080.0284

A Set-Covering Approach with Column Generation for Parsimony Haplotyping

Pages:151–166

Published Online:September 5, 2008

https://doi.org/10.1287/ijoc.1080.0285

New Exact Algorithms for One-Machine Earliness-Tardiness Scheduling

Pages:167–175

Published Online:September 17, 2008

https://doi.org/10.1287/ijoc.1080.0287

INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.