Capacity inverse minimum cost flow problems under the weighted Hamming distance
Authors:
- 7 July 2015
- journal article
- Published by Springer Nature in Optimization Letters
- Vol. 10 (6) , 1257-1268
Abstract
No abstract availableKeywords
Funding Information
- National Natural Science Foundation of China (ID0EWKAE15)
- Fujian Provincial Natural Science Foundation of China (ID0EAPAE16)
- Fundamental Research Funds for the Central Universities (ID0EITAE17)
This publication has 13 references indexed in Scilit:
- Note on “Inverse minimum cost flow problems under the weighted Hamming distance”European Journal of Operational Research, 2014
- Inverse minimum cost flow problems under the weighted Hamming distanceEuropean Journal of Operational Research, 2010
- Capacity inverse minimum cost flow problemJournal of Combinatorial Optimization, 2008
- Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problemsComputational Optimization and Applications, 2006
- Inverse maximum flow problems under the weighted Hamming distanceJournal of Combinatorial Optimization, 2006
- Some inverse optimization problems under the Hamming distanceEuropean Journal of Operational Research, 2006
- Weighted Inverse Minimum Spanning Tree Problems Under Hamming DistanceJournal of Combinatorial Optimization, 2005
- Inverse Combinatorial Optimization: A Survey on Problems, Methods, and ResultsJournal of Combinatorial Optimization, 2004
- Inverse OptimizationOperations Research, 2001
- On an instance of the inverse shortest paths problemMathematical Programming, 1992