✦ LIBER ✦

A polynomial algorithm for a one machine batching problem

✍ Scribed by David F Shallcross

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 329 KB
Volume: 11
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(92)90027-z

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A polynomial algorithm for one problem o

A polynomial algorithm for one problem of guillotine cutting

✍ M.Z. Arslanov 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 170 KB

A pseudo-polynomial algorithm for a two-

A pseudo-polynomial algorithm for a two-machine no-wait job-shop scheduling problem

✍ Wieslaw Kubiak 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 273 KB

A polynomial algorithm for a constrained

A polynomial algorithm for a constrained traveling salesman problem

✍ J.H. Rubinstein; D.A. Thomas; N.C. Wormald 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 125 KB

## Abstract We give a polynomial‐time algorithm for finding a solution to the Traveling Salesman Problem when the points given are constrained to lie on a fixed set of smooth curves of finite length. © 2001 John Wiley & Sons, Inc.

A polynomial algorithm for thep-centdian

A polynomial algorithm for thep-centdian problem on a tree

✍ Tamir, Arie; P�rez-Brito, Dionisio; Moreno-P�rez, Jos� A. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 108 KB 👁 2 views

The most common problems studied in network location theory are the p-median and the p-center models. The p-median problem on a network is concerned with the location of p points (medians) on the network, such that the total (weighted) distance of all the nodes to their respective nearest points is

Polynomial time approximation algorithms

Polynomial time approximation algorithms for machine scheduling: ten open problems

✍ Petra Schuurman; Gerhard J. Woeginger 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 91 KB 👁 2 views

We discuss what we consider to be the 10 most vexing open questions in the area of polynomial time approximation algorithms for NP-hard deterministic machine scheduling problems. We summarize what is known on these problems, we discuss related results, and we provide pointers to the literature. Copy

A Polynomial-time Algorithm for the Bist

A Polynomial-time Algorithm for the Bistable Roommates Problem

✍ Jay Sethuraman; Chung-Piaw Teo 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 127 KB

In a recent paper, Weems introduced the bistable matching problem, and asked if a polynomial-time algorithm exists to decide the feasibility of the bistable roommates problem. We resolve this question in the affirmative using linear programming. In addition, we show that several (old and new) result