𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Time-constrained Chinese postman problems

✍ Scribed by Hsiao-Fan Wang; Yu-Pin Wen

Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
941 KB
Volume
44
Category
Article
ISSN
0898-1221

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the mixed Chinese postman problem
On the mixed Chinese postman problem
✍ T.K. Ralphs πŸ“‚ Article πŸ“… 1993 πŸ› Elsevier Science 🌐 English βš– 289 KB

The mixed Chinese postman problem is a version of the well-known Chinese postman problem in which the underlying graph consists of both directed and undirected edges. We give an integer linear programming formulation for this problem and then show that the extreme points of its linear relaxation pol

Polynomial time approximation schemes fo
Polynomial time approximation schemes for class-constrained packing problems
✍ Hadas Shachnai; Tami Tamir πŸ“‚ Article πŸ“… 2001 πŸ› Springer US 🌐 English βš– 207 KB

We consider variants of the classic bin packing and multiple knapsack problems, in which sets of items of di erent classes (colours) need to be placed in bins; the items may have di erent sizes and values. Each bin has a limited capacity, and a bound on the number of distinct classes of items it can

On the max-cut problem for a planar, cub
On the max-cut problem for a planar, cubic, triangle-free graph, and the Chinese postman problem for a planar triangulation
✍ Carsten Thomassen πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 109 KB πŸ‘ 2 views

## Abstract Every 3‐connected planar, cubic, triangle‐free graph with __n__ vertices has a bipartite subgraph with at least 29__n__/24β€‰βˆ’β€‰7/6 edges. The constant 29/24 improves the previously best known constant 6/5 which was considered best possible because of the graph of the dodecahedron. Example