Help
Cart
Skip main navigation

Available Issues

April 12, 2013 - April 13, 2026

Available Issues

April 12, 2013 - April 13, 2026

Editorial

Free Access
From the Editor

Pages:97–97

Published Online:May 1, 2002

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

Research Article

Contrasting Structured and Random Permutation Flow-Shop Scheduling Problems: Search-Space Topology and Algorithm Performance

Pages:98–123

Published Online:May 1, 2002

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

Preview Abstract
Calculating the Distribution of a Linear Combination of Uniform Order Statistics

Pages:124–131

Published Online:May 1, 2002

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

Preview Abstract
Solution of a Min-Max Vehicle Routing Problem

Pages:132–143

Published Online:May 1, 2002

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

Preview Abstract
Minimizing the Average Query Complexity of Learning Monotone Boolean Functions

Pages:144–174

Published Online:May 1, 2002

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

Preview Abstract
Experimental Comparison of Approximation Algorithms for Scheduling Unrelated Parallel Machines

Pages:175–189

Published Online:May 1, 2002

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

Preview Abstract
Previous
Back to Top
Next
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.
Agree