✦ LIBER ✦

A Dynamic Domain Contraction Algorithm for Nonconvex Piecewise Linear Network Flow Problems*

✍ Scribed by Dukwon Kim; Panos M. Pardalos

Book ID: 111563028
Publisher: Springer US
Year: 2000
Tongue: English
Weight: 82 KB
Volume: 17
Category: Article
ISSN: 0925-5001
DOI: 10.1023/a:1026502220076

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic slope scaling and trust interval

Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems

✍ Kim, Dukwon; Pardalos, Panos M. 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 126 KB

In this paper, we propose an efficient heuristic approach for solving concave Piecewise Linear Network Flow Problems (PLNFP) in which the cost is separable and each arc cost is concave piecewise linear function of the total flow along the arcs. The problem is well known to be NP NP NP-hard and exact

A primal algorithm for solving a capacit

A primal algorithm for solving a capacitated network flow problem with additional linear constraints

✍ S. Chen; R. Saigal 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 768 KB

Use of dynamic trees in a network simple

Use of dynamic trees in a network simplex algorithm for the maximum flow problem

✍ Andrew V. Goldberg; Michael D. Grigoriadis; Robert E. Tarjan 📂 Article 📅 1991 🏛 Springer-Verlag 🌐 English ⚖ 735 KB

A neural network model and algorithm for

A neural network model and algorithm for the hybrid flow shop scheduling problem in a dynamic environment

✍ Lixin Tang; Wenxin Liu; Jiyin Liu 📂 Article 📅 2005 🏛 Springer US 🌐 English ⚖ 326 KB

Linear Approximations in a Dynamic Progr

Linear Approximations in a Dynamic Programming Approach for the Uncapacitated Single-Source Minimum Concave Cost Network Flow Problem in Acyclic Networks

✍ Rainer E. Burkard; Helidon Dollani; Phan Thien Thach 📂 Article 📅 2001 🏛 Springer US 🌐 English ⚖ 126 KB