Help
Cart
Skip main navigation

Available Issues

April 12, 2013 - June 15, 2026

Available Issues

April 12, 2013 - June 15, 2026

Guest Editors' Introduction

Free Access
Guest Editors' Introduction

Pages:357–359

Published Online:November 1, 1992

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

Preview Abstract

Research Article

Dynamic Three-Dimensional Linear Programming

Pages:360–368

Published Online:November 1, 1992

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

Preview Abstract
Recognizing Voronoi Diagrams with Linear Programming

Pages:369–374

Published Online:November 1, 1992

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

Preview Abstract
Matching Points into Pairwise-Disjoint Noise Regions: Combinatorial Bounds and Algorithms

Pages:375–386

Published Online:November 1, 1992

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

Preview Abstract
Fast Algorithms for Geometric Traveling Salesman Problems

Pages:387–411

Published Online:November 1, 1992

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

Preview Abstract
The Voronoi Partition of a Network and Its Implications in Location Theory

Pages:412–417

Published Online:November 1, 1992

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

Preview Abstract
Efficient Algorithms for the Capacitated 1-Median Problem

Pages:418–425

Published Online:November 1, 1992

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

Preview Abstract
1-Segment Center Problems

Pages:426–434

Published Online:November 1, 1992

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

Preview Abstract
On the Optimal Bisection of a Polygon

Pages:435–438

Published Online:November 1, 1992

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

Preview Abstract
Monotone Pieces of Chains

Pages:439–446

Published Online:November 1, 1992

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

Preview Abstract
“Lion and Man”: Upper and Lower Bounds

Pages:447–452

Published Online:November 1, 1992

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

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