Help
Cart
Skip main navigation

Available Issues

April 12, 2013 - April 13, 2026

Available Issues

April 12, 2013 - April 13, 2026

Research Article

A Mathematical Programming Approach to Data Base Normalization

Pages:1–14

Published Online:February 1, 1997

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

Preview Abstract
How Much Communication Does Parallel Branch and Bound Need?

Pages:15–29

Published Online:February 1, 1997

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

Preview Abstract
A Branch-and-Bound Approach Using Polyhedral Results for a Clustering Problem

Pages:30–42

Published Online:February 1, 1997

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

Preview Abstract
A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination

Pages:43–50

Published Online:February 1, 1997

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

Preview Abstract
On the Use of the Power Series Algorithm for General Markov Processes, with an Application to a Petri Net

Pages:51–56

Published Online:February 1, 1997

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

Preview Abstract
Bad Lattice Structures for Vectors of Nonsuccessive Values Produced by Some Linear Recurrences

Pages:57–60

Published Online:February 1, 1997

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

Preview Abstract
Toward a Taxonomy of Parallel Tabu Search Heuristics

Pages:61–72

Published Online:February 1, 1997

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

Preview Abstract
Presolve Analysis of Linear Programs Prior to Applying an Interior Point Method

Pages:73–91

Published Online:February 1, 1997

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

Preview Abstract
Earliness-Tardiness Scheduling Around Almost Equal Due Dates

Pages:92–99

Published Online:February 1, 1997

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

Preview Abstract
Art Gallery Problems for Convex Nested Polygons

Pages:100–110

Published Online:February 1, 1997

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

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