


default search action
Annals of Operations Research, Volume 50
Volume 50, Number 1, 1994
- Celso C. Ribeiro, Nelson Maculan:

Foreword. - Alexandre A. Andreatta, Celso C. Ribeiro

:
A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits. 1-36 - J. R. Araque G, Gautham K. Kudva, Thomas L. Morin, Joseph F. Pekny:

A branch-and-cut algorithm for vehicle routing problems. 37-59 - E. Andrew Boyd:

Solving 0/1 integer programs with enumeration cutting planes. 61-72 - Peter Brucker, Bernd Jurisch, Andreas Krämer:

The job-shop problem and immediate selection. 73-114 - Wen-Chyuan Chiang

, Panagiotis Kouvelis:
Simulated annealing and tabu search approaches to unidirectional flowpath design for Automated Guided Vehicle Systems. 115-142 - Sunil Chopra

:
Comparison of formulations and a heuristic for packing Steiner trees in a graph. 143-171 - Charles J. Colbourn, Louis D. Nel, T. Brian Boffey, Derek F. Yates:

Network reliability and the probabilistic estimation of damage from fire spread. 173-185 - Luis Contesse B:

A general algorithm for determining all essential solutions and inequalities for any convex polyhedron. 187-218 - Laureano F. Escudero

, Monique Guignard, Kavindra Malik:
A Lagrangian relax-and-cut approach for the sequential ordering problem with precedence relationships. 219-237 - Bernard T. Han, George Diehr, Jack S. Cook:

Multiple-type, two-dimensional bin packing problems: Applications and algorithms. 239-261 - Wenxue Han, Pierre Dejax:

An efficient heuristic based on machine workload for the flowshop scheduling problem with setup and removal. 263-279 - Samuel Jurkiewicz:

Planar graphs, Hamilton cycles and extreme independence number. 281-293 - Selçuk Karabati

, Panagiotis Kouvelis:
The interface of buffer design and cyclic scheduling decisions in deterministic flow lines. 295-317 - Panagiotis Kouvelis, Gang Yu, Songjun Luo:

Vertex packing problem application to the design of electronic testing fixtures. 319-337 - Youngho Lee, Hanif D. Sherali:

Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem. 339-365 - Cristina M. A. Leopoldino, Mario V. F. Pereira

, Leontina M. V. Pinto, Celso C. Ribeiro
:
A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning. 367-385 - Yong Li, Panos M. Pardalos, K. G. Ramakrishnan, Mauricio G. C. Resende:

Lower bounds for the quadratic assignment problem. 387-410 - Francisco Menezes, Pedro Barahona

:
Heuristics and look-ahead integration to solve constraint satisfaction problems efficiently. 411-426 - Philippe Michelon, Marcelo Dib Cruz, Viviane Gascon:

Using the tabu search method for the distribution of supplies in a hospital. 427-435 - Leone C. Monticone, George Funk:

Application of the facility location problem to the problem of locating concentrators on an FAA microwave system. 437-454 - Robert M. Nauss:

Optimizing single-terminal dispatch of large volume trips to trucks. 455-471 - Nelio Domingues Pizzolato:

A heuristic for large-sizep-median location problems with application to school location. 473-485 - Michael Racer, Mohammad M. Amini:

A robust heuristic for the Generalized Assignment Problem. 487-503 - Harold K. Rappoport, Laurence S. Levy, Katherine J. Toussaint, Bruce L. Golden:

A transportation problem formulation for the MAC Airlift Planning problem. 505-523 - William T. Scherer, Frank Rotman:

Combinatorial optimization techniques for spacecraft scheduling automation. 525-556 - Kleber X. X. De Souza, Vinícius Amaral Armentano:

Multi-item capacitated lot-sizing by a Cross decomposition based algorithm. 557-574 - Daniel Tuyttens, Marc Pirlot

, Jacques Teghem, E. Trauwaert, B. Liégeois:
Homogeneous grouping of nuclear fuel cans through simulated annealing and tabu search. 575-607

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














