An ε-relaxation method for separable convex cost generalized network flow problems

Mathematical Programming ◽

10.1007/pl00011379 ◽

2000 ◽

Vol 88 (1) ◽

pp. 85-104 ◽

Author(s):

Paul Tseng ◽

Dimitri P. Bertsekas

Keyword(s):

Network Flow ◽

Relaxation Method ◽

Network Flow Problems ◽

Flow Problems ◽

Convex Cost ◽

Generalized Network Flow

Download Full-text

An $\epsilon$-Relaxation Method for Separable Convex Cost Network Flow Problems

SIAM Journal on Optimization ◽

10.1137/s1052623495285886 ◽

1997 ◽

Vol 7 (3) ◽

pp. 853-870 ◽

Author(s):

Dimitri P. Bertsekas ◽

Lazaros C. Polymenakos ◽

Paul Tseng

Keyword(s):

Network Flow ◽

Relaxation Method ◽

Network Flow Problems ◽

Flow Problems ◽

Download Full-text

Implementation and Test of Auction Methods for Solving Generalized Network Flow Problems with Separable Convex Cost

Journal of Optimization Theory and Applications ◽

10.1023/a:1019629113986 ◽

2002 ◽

Vol 115 (1) ◽

pp. 113-144 ◽

Author(s):

F. Guerriero ◽

P. Tseng

Keyword(s):

Network Flow ◽

Network Flow Problems ◽

Flow Problems ◽

Convex Cost ◽

Generalized Network Flow

Download Full-text

An ε-Relaxation method for generalized separable convex cost network flow problems

Integer Programming and Combinatorial Optimization - Lecture Notes in Computer Science ◽

10.1007/3-540-61310-2_7 ◽

1996 ◽

pp. 85-93 ◽

Author(s):

Paul Tseng ◽

Dimitri P. Bertsekas

Keyword(s):

Network Flow ◽

Relaxation Method ◽

Network Flow Problems ◽

Flow Problems ◽

Download Full-text

Optimal control for generalized network-flow problems

IEEE INFOCOM 2017 - IEEE Conference on Computer Communications ◽

10.1109/infocom.2017.8056980 ◽

2017 ◽

Author(s):

Abhishek Sinha ◽

Eytan Modiano

Keyword(s):

Optimal Control ◽

Network Flow ◽

Network Flow Problems ◽

Flow Problems ◽

Generalized Network Flow

Download Full-text

Relaxation Methods for Minimum Cost Ordinary and Generalized Network Flow Problems

Operations Research ◽

10.1287/opre.36.1.93 ◽

1988 ◽

Vol 36 (1) ◽

pp. 93-114 ◽

Author(s):

Dimitri P. Bertsekas ◽

Paul Tseng

Keyword(s):

Network Flow ◽

Minimum Cost ◽

Network Flow Problems ◽

Relaxation Methods ◽

Flow Problems ◽

Generalized Network Flow

Download Full-text

Combinatorial interior point methods for generalized network flow problems

Mathematical Programming ◽

10.1007/s10107-002-0333-y ◽

2002 ◽

Vol 93 (2) ◽

pp. 227-246 ◽

Author(s):

Donald Goldfarb ◽

Yiqing Lin

Keyword(s):

Interior Point ◽

Network Flow ◽

Interior Point Methods ◽

Network Flow Problems ◽

Flow Problems ◽

Generalized Network Flow

Download Full-text

Hydro-storage subproblems in power generation: an approach with a relaxation method for network flow problems

2003 IEEE Bologna Power Tech Conference Proceedings, ◽

10.1109/ptc.2003.1304507 ◽

2004 ◽

Author(s):

H. Heitsch ◽

W. Romisch

Keyword(s):

Power Generation ◽

Network Flow ◽

Relaxation Method ◽

Network Flow Problems ◽

Download Full-text

ɛ-Relaxation and Auction Methods for Separable Convex Cost Network Flow Problems

Lecture Notes in Economics and Mathematical Systems - Network Optimization ◽

10.1007/978-3-642-59179-2_6 ◽

1997 ◽

pp. 103-126 ◽

Author(s):

Dimitri P. Bertsekas ◽

Lakis C. Polymenakos ◽

Paul Tseng

Keyword(s):

Network Flow ◽

Network Flow Problems ◽

Flow Problems ◽

Download Full-text

Optimal Control for Generalized Network-Flow Problems

IEEE/ACM Transactions on Networking ◽

10.1109/tnet.2017.2783846 ◽

2018 ◽

Vol 26 (1) ◽

pp. 506-519 ◽

Author(s):

Abhishek Sinha ◽

Eytan Modiano

Keyword(s):

Optimal Control ◽

Network Flow ◽

Network Flow Problems ◽

Flow Problems ◽

Generalized Network Flow

Download Full-text

Accelerated dual coordinate algorithms for separable convex cost network flow problems

2012 IEEE 51st IEEE Conference on Decision and Control (CDC) ◽

10.1109/cdc.2012.6426480 ◽

2012 ◽

Author(s):

Ajay Kumar Bangla ◽

David A. Castanon

Keyword(s):

Network Flow ◽

Network Flow Problems ◽

Flow Problems ◽

Download Full-text