Note on “Inverse minimum cost flow problems under the weighted Hamming distance”

European Journal of Operational Research ◽

10.1016/j.ejor.2013.11.014 ◽

2014 ◽

Vol 234 (3) ◽

pp. 916-920 ◽

Author(s):

Javad Tayyebi ◽

Massoud Aman

Keyword(s):

Hamming Distance ◽

Minimum Cost ◽

Minimum Cost Flow ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems

Download Full-text

Inverse minimum cost flow problems under the weighted Hamming distance

European Journal of Operational Research ◽

10.1016/j.ejor.2010.03.029 ◽

2010 ◽

Vol 207 (1) ◽

pp. 50-54 ◽

Author(s):

Yiwei Jiang ◽

Longcheng Liu ◽

Biao Wu ◽

Enyu Yao

Keyword(s):

Hamming Distance ◽

Minimum Cost ◽

Minimum Cost Flow ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems

Download Full-text

Capacity inverse minimum cost flow problems under the weighted Hamming distance

Optimization Letters ◽

10.1007/s11590-015-0919-y ◽

2015 ◽

Vol 10 (6) ◽

pp. 1257-1268 ◽

Author(s):

Longcheng Liu ◽

Enyu Yao

Keyword(s):

Hamming Distance ◽

Minimum Cost ◽

Minimum Cost Flow ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems

Download Full-text

Minimum-Cost Flow Problems

Algorithmic Aspects of Flows in Networks ◽

10.1007/978-94-011-3444-6_4 ◽

1991 ◽

pp. 44-62

Author(s):

Günther Ruhe

Keyword(s):

Minimum Cost ◽

Minimum Cost Flow ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems

Download Full-text

On seeking efficient Pareto optimal points in multi-player minimum cost flow problems with application to transportation systems

Journal of Global Optimization ◽

10.1007/s10898-019-00750-9 ◽

2019 ◽

Vol 74 (3) ◽

pp. 523-548

Author(s):

Shuvomoy Das Gupta ◽

Lacra Pavel

Keyword(s):

Minimum Cost ◽

Transportation Systems ◽

Pareto Optimal ◽

Minimum Cost Flow ◽

Flow Problems ◽

Cost Flow ◽

Pareto Optimal Points ◽

Minimum Cost Flow Problems

Download Full-text

Complexity of strict robust integer minimum cost flow problems: An overview and further results

Computers & Operations Research ◽

10.1016/j.cor.2018.12.021 ◽

2019 ◽

Vol 104 ◽

pp. 228-238 ◽

Author(s):

André Chassein ◽

Anika Kinscherff

Keyword(s):

Minimum Cost ◽

Minimum Cost Flow ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems

Download Full-text

A POLYNOMIAL TIME INTERIOR POINT ALGORITHM FOR MINIMUM COST FLOW PROBLEMS

Journal of the Operations Research Society of Japan ◽

10.15807/jorsj.33.157 ◽

1990 ◽

Vol 33 (2) ◽

pp. 157-167 ◽

Author(s):

Kaori Masuzawa ◽

Shinji Mizuno ◽

Masao Mori

Keyword(s):

Polynomial Time ◽

Interior Point ◽

Minimum Cost ◽

Interior Point Algorithm ◽

Minimum Cost Flow ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems

Download Full-text

A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives

SIAM Journal on Computing ◽

10.1137/140978296 ◽

2016 ◽

Vol 45 (5) ◽

pp. 1729-1761 ◽

Author(s):

László A. Végh

Keyword(s):

Polynomial Algorithm ◽

Minimum Cost ◽

Minimum Cost Flow ◽

Strongly Polynomial Algorithm ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems ◽

Strongly Polynomial

Download Full-text

A Probabilistic Tree-Based Representation for Non-convex Minimum Cost Flow Problems

Parallel Problem Solving from Nature – PPSN XV - Lecture Notes in Computer Science ◽

10.1007/978-3-319-99253-2_6 ◽

2018 ◽

pp. 69-81 ◽

Author(s):

Behrooz Ghasemishabankareh ◽

Melih Ozlen ◽

Frank Neumann ◽

Xiaodong Li

Keyword(s):

Minimum Cost ◽

Minimum Cost Flow ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems

Download Full-text

Fast Algorithms for Specially Structured Minimum Cost Flow Problems with Applications

Operations Research ◽

10.1287/opre.1100.0846 ◽

2010 ◽

Vol 58 (6) ◽

pp. 1681-1696 ◽

Author(s):

Balachandran Vaidyanathan ◽

Ravindra K. Ahuja

Keyword(s):

Fast Algorithms ◽

Minimum Cost ◽

Minimum Cost Flow ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems

Download Full-text

A genetic algorithm with local search for solving single-source single-sink nonlinear non-convex minimum cost flow problems

Soft Computing ◽

10.1007/s00500-019-03951-2 ◽

2019 ◽

Vol 24 (2) ◽

pp. 1153-1169 ◽

Author(s):

Behrooz Ghasemishabankareh ◽

Melih Ozlen ◽

Xiaodong Li ◽

Kalyanmoy Deb

Keyword(s):

Genetic Algorithm ◽

Local Search ◽

Minimum Cost ◽

Single Source ◽

Minimum Cost Flow ◽

Flow Problems ◽

Cost Flow ◽

Minimum Cost Flow Problems

Download Full-text