Research Article

A Randomized Exhaustive Propositionalization Approach for Molecule Classification

Pages:331–345

Published Online:August 31, 2010

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

The Knowledge-Gradient Algorithm for Sequencing Experiments in Drug Discovery

Pages:346–363

Published Online:December 29, 2010

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

A Cluster-Based Context-Tree Model for Multivariate Data Streams with Applications to Anomaly Detection

Pages:364–376

Published Online:September 24, 2010

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

A Linearly Convergent Linear-Time First-Order Algorithm for Support Vector Classification with a Core Set Result

Pages:377–391

Published Online:September 24, 2010

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

Predicting the Solution Time of Branch-and-Bound Algorithms for Mixed-Integer Programs

Pages:392–403

Published Online:August 31, 2010

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

A Branch-and-Price Algorithm for the Bin Packing Problem with Conflicts

Pages:404–415

Published Online:September 24, 2010

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

Lifted Tableaux Inequalities for 0–1 Mixed-Integer Programs: A Computational Study

Pages:416–424

Published Online:September 24, 2010

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

Minimal Equivalent Binary Knapsack Inequalities

Pages:425–429

Published Online:September 24, 2010

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

Efficient Optimization of Reliable Two-Node Connected Networks: A Biobjective Approach

Pages:430–445

Published Online:August 31, 2010

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

Color-Coding Algorithms to the Balanced Path Problem: Computational Issues

Pages:446–459

Published Online:August 31, 2010

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

Preprocessing Stochastic Shortest-Path Problems with Application to PERT Activity Networks

Pages:460–469

Published Online:September 24, 2010

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

The Reliable Facility Location Problem: Formulations, Heuristics, and Approximation Algorithms

Pages:470–482

Published Online:December 2, 2010

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

An Efficient Global Approach for Posynomial Geometric Programming Problems

Pages:483–492

Published Online:August 31, 2010

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

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.