𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A polynomial-time algorithm for the change-making problem

✍ Scribed by David Pearson

Publisher
Elsevier Science
Year
2005
Tongue
English
Weight
143 KB
Volume
33
Category
Article
ISSN
0167-6377

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

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.