Help
Cart
Skip main navigation

Available Issues

April 12, 2013 - April 13, 2026

Available Issues

April 12, 2013 - April 13, 2026

Research Article

Exact Solution of the Quadratic Knapsack Problem

Pages:125–137

Published Online:May 1, 1999

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

Preview Abstract
Computing Minimum-Weight Perfect Matchings

Pages:138–148

Published Online:May 1, 1999

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

Preview Abstract
An Efficient Decomposition Algorithm to Optimize Spare Capacity in a Telecommunications Network

Pages:149–160

Published Online:May 1, 1999

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

Preview Abstract
A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem

Pages:161–172

Published Online:May 1, 1999

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

Preview Abstract
A Computational Study of Search Strategies for Mixed Integer Programming

Pages:173–187

Published Online:May 1, 1999

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

Preview Abstract
Packet Routing in Telecommunication Networks with Path and Flow Restrictions

Pages:188–197

Published Online:May 1, 1999

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

Preview Abstract
Improved Constructive Multistart Strategies for the Quadratic Assignment Problem Using Adaptive Memory

Pages:198–204

Published Online:May 1, 1999

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

Preview Abstract
A Class of Hard Small 0-1 Programs

Pages:205–210

Published Online:May 1, 1999

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

Preview Abstract
An Approximation Scheme for Minimizing Agreeably Weighted Variance on a Single Machine

Pages:211–216

Published Online:May 1, 1999

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

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