✦ LIBER ✦

A branch-and-bound algorithm for solving fixed charge problems

✍ Scribed by Patrick G. McKeown

Publisher: John Wiley and Sons
Year: 1981
Tongue: English
Weight: 616 KB
Volume: 28
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800280409

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A branch and bound algorithm for solving

A branch and bound algorithm for solving a class of nonlinear integer programming problems

✍ A. Victor Cabot; S. Selcuk Erenguc 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 501 KB

Some branch-and-bound procedures for fix

Some branch-and-bound procedures for fixed-cost transportation problems

✍ A. Victor Cabot; S. Selcuk Erenguc 📂 Article 📅 1984 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

A branch-and-cut algorithm for the singl

A branch-and-cut algorithm for the single-commodity, uncapacitated, fixed-charge network flow problem

✍ Francisco Ortega; Laurence A. Wolsey 📂 Article 📅 2003 🏛 John Wiley and Sons 🌐 English ⚖ 180 KB 👁 1 views

A branch-and-cut algorithm for solving g

A branch-and-cut algorithm for solving generalized multiperiod Steiner problems in graphs

✍ Suhl, Uwe H.; Hilbert, Heinrich 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 163 KB 👁 2 views

Given is an undirected graph with positive or negative edge weights which represent a profit if an investment such as installing a gas pipe takes place in a given time period. A certain part of the graph may already be piped in previous periods. The task is to extend the piped subgraph in the most p

A branch-and-bound-based heuristic for s

A branch-and-bound-based heuristic for solving the quadratic assignment problem

✍ M. S. Bazaraa; O. Kirca 📂 Article 📅 1983 🏛 John Wiley and Sons 🌐 English ⚖ 897 KB

A relaxation/decomposition algorithm for

A relaxation/decomposition algorithm for the fixed charged network problem

✍ Bala Shetty 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 789 KB