Research Article

Progress in Linear Programming-Based Algorithms for Integer Programming: An Exposition

Pages:2–23

Published Online:February 1, 2000

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

Statistical Analysis of Computational Tests of Algorithms and Heuristics

Pages:24–44

Published Online:February 1, 2000

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

Parallelizing the Dual Simplex Method

Pages:45–56

Published Online:February 1, 2000

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

When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)?

Pages:57–74

Published Online:February 1, 2000

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

A Minimal Algorithm for the Bounded Knapsack Problem

Pages:75–82

Published Online:February 1, 2000

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

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.