A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits Alexandre A. AndreattaCelso C. Ribeiro OriginalPaper Pages: 1 - 36
A branch-and-cut algorithm for vehicle routing problems J. R. Araque GG. KudvaJ. F. Pekny OriginalPaper Pages: 37 - 59
Solving 0/1 integer programs with enumeration cutting planes E. Andrew Boyd OriginalPaper Pages: 61 - 72
The job-shop problem and immediate selection Peter BruckerBernd JurischAndreas Krämer OriginalPaper Pages: 73 - 114
Simulated annealing and tabu search approaches to unidirectional flowpath design for Automated Guided Vehicle Systems Wen-Chyuan ChiangPanagiotis Kouvelis OriginalPaper Pages: 115 - 142
Comparison of formulations and a heuristic for packing Steiner trees in a graph Sunil Chopra OriginalPaper Pages: 143 - 171
Network reliability and the probabilistic estimation of damage from fire spread Charles J. ColbournLouis D. NelD. F. Yates OriginalPaper Pages: 173 - 185
A general algorithm for determining all essential solutions and inequalities for any convex polyhedron Luis Contesse B OriginalPaper Pages: 187 - 218
A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships L. F. EscuderoMonique GuignardKavindra Malik OriginalPaper Pages: 219 - 237
Multiple-type, two-dimensional bin packing problems: Applications and algorithms Bernard T. HanGeorge DiehrJack S. Cook OriginalPaper Pages: 239 - 261
An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal Wenxue HanPierre Dejax OriginalPaper Pages: 263 - 279
Planar graphs, Hamilton cycles and extreme independence number Samuel Jurkiewicz OriginalPaper Pages: 281 - 293
The interface of buffer design and cyclic scheduling decisions in deterministic flow lines Selcuk KarabatiPanagiotis Kouvelis OriginalPaper Pages: 295 - 317
Vertex packing problem application to the design of electronic testing fixtures Panagiotis KouvelisGang YuSongjun Luo OriginalPaper Pages: 319 - 337
Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem Youngho LeeHanif D. Sherali OriginalPaper Pages: 339 - 365
A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning Cristina M. A. LeopoldinoMário V. F. PereiraCelso C. Ribeiro OriginalPaper Pages: 367 - 385
Lower bounds for the quadratic assignment problem Y. LiP. M. PardalosM. G. C. Resende OriginalPaper Pages: 387 - 410
Heuristics and look-ahead integration to solve constraint satisfaction problems efficiently Francisco MenezesPedro Barahona OriginalPaper Pages: 411 - 426
Using the tabu search method for the distribution of supplies in a hospital Philippe MichelonMarcelo Dib CruzViviane Gascon OriginalPaper Pages: 427 - 435
Application of the facility location problem to the problem of locating concentrators on an FAA microwave system Leone C. MonticoneGeorge Funk OriginalPaper Pages: 437 - 454
Optimizing single-terminal dispatch of large volume trips to trucks Robert M. Nauss OriginalPaper Pages: 455 - 471
A heuristic for large-sizep-median location problems with application to school location Nelio Domingues Pizzolato OriginalPaper Pages: 473 - 485
A robust heuristic for the Generalized Assignment Problem Michael RacerMohammad M. Amini OriginalPaper Pages: 487 - 503
A transportation problem formulation for the MAC Airlift Planning problem Harold K. RappoportLaurence S. LevyBruce L. Golden OriginalPaper Pages: 505 - 523
Combinatorial optimization techniques for spacecraft scheduling automation William T. SchererFrank Rotman OriginalPaper Pages: 525 - 556
Multi-item capacitated lot-sizing by a Cross decomposition based algorithm Kleber X. X. De SouzaVinícius A. Armentano OriginalPaper Pages: 557 - 574
Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search D. TuyttensM. PirlotB. Liégeois OriginalPaper Pages: 575 - 607
