Research Article

Core Routing on Dynamic Time-Dependent Road Networks

Pages:187–201

Published Online:April 7, 2011

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

A Level-3 Reformulation-Linearization Technique-Based Bound for the Quadratic Assignment Problem

Pages:202–209

Published Online:May 17, 2011

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

Data-Mining-Driven Neighborhood Search

Pages:210–227

Published Online:May 17, 2011

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

An Optimal Constraint Programming Approach to the Open-Shop Problem

Pages:228–244

Published Online:April 7, 2011

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

Finding All Stable Pairs and Solutions to the Many-to-Many Stable Matching Problem

Pages:245–259

Published Online:April 7, 2011

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

An Exact Method for Balancing Efficiency and Equity in the Liver Allocation Hierarchy

Pages:260–275

Published Online:May 17, 2011

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

The Balanced Minimum Evolution Problem

Pages:276–294

Published Online:May 17, 2011

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

C-NORTA: A Rejection Procedure for Sampling from the Tail of Bivariate NORTA Distributions

Pages:295–310

Published Online:May 17, 2011

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

A Study of Quality and Accuracy Trade-offs in Process Mining

Pages:311–327

Published Online:March 10, 2011

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

An Improved Branch-and-Bound Method for Maximum Monomial Agreement

Pages:328–341

Published Online:June 17, 2011

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

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.