Research Article

An Exact Algorithm for the Multitrip Vehicle Routing Problem

Pages:193–207

Published Online:February 13, 2012

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

A New Local Search Algorithm for Binary Optimization

Pages:208–221

Published Online:April 11, 2012

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

On Maximum Speedup Ratio of Restart Algorithm Portfolios

Pages:222–229

Published Online:April 11, 2012

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

Stochastic Trust-Region Response-Surface Method (STRONG)—A New Response-Surface Framework for Simulation Optimization

Pages:230–243

Published Online:April 11, 2012

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

Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm

Pages:244–255

Published Online:May 4, 2012

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

Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem

Pages:256–270

Published Online:April 11, 2012

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

Valid Linear Programming Bounds for Exact Mixed-Integer Programming

Pages:271–284

Published Online:April 11, 2012

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

Critically Loaded Time-Varying Multiserver Queues: Computational Challenges and Approximations

Pages:285–301

Published Online:May 4, 2012

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

Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem

Pages:302–316

Published Online:April 11, 2012

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

Rapid Screening Procedures for Zero-One Optimization via Simulation

Pages:317–331

Published Online:May 4, 2012

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

A Binary Search Heuristic Algorithm Based on Randomized Local Search for the Rectangular Strip-Packing Problem

Pages:332–345

Published Online:June 6, 2012

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

A Powerful Genetic Algorithm Using Edge Assembly Crossover for the Traveling Salesman Problem

Pages:346–363

Published Online:May 4, 2012

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

Expected Tardiness Computations in Multiclass Priority M/M/c Queues

Pages:364–376

Published Online:June 6, 2012

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

An Algorithm for Approximating Convex Pareto Surfaces Based on Dual Techniques

Pages:377–393

Published Online:June 6, 2012

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

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.