Algorithms for the partial inverse matroid problem in which weights can only be increased

DOI10.1007/S10898-016-0412-XzbMATH Open1390.90454OpenAlexW2276896195MaRDI QIDQ312484FDOQ312484

Authors: Zhao Zhang, Shuangshuang Li, Hong-Jian Lai, Du Ding-Zhu 

Publication date: 15 September 2016

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-016-0412-x

Recommendations

• Algorithm for constraint partial inverse matroid problem with weight increase forbidden
• Inverse matroid optimization problem under the weighted Hamming distances
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• A weighted linear matroid parity algorithm
• A weighted linear matroid parity algorithm
• Exact and approximation algorithms for weighted matroid intersection
• Exact and approximation algorithms for weighted matroid intersection
• On the inverse of a class of weighted graphs
• On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
• Inverse problems of matroid intersection

zbMATH Keywords

constrained optimizationmatroidpolynomial time algorithmpartial inverse problem

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26) Combinatorial aspects of matroids and geometric lattices (05B35)

Cites Work

• Title not available (Why is that?)
• Inverse combinatorial optimization: a survey on problems, methods, and results
• Encyclopedia of Optimization
• Inverse Optimization
• On an instance of the inverse shortest paths problem
• The base-matroid and inverse combinatorial optimization problems.
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• Partial inverse assignment problems under \(l_{1}\) norm
• Complexity of partial inverse assignment problem and partial inverse cut problem
• Topics in Matroid Theory
• The partial inverse minimum cut problem with \(L_1\)-norm is strongly NP-hard
• Title not available (Why is that?)
• A weighted matroid intersection algorithm
• Robust partial inverse network flow problems
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems

Cited In (10)

• Combinatorial algorithms for restricted inverse optimal value problems on minimum spanning tree under weighted \(l_1\) norm
• Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm
• The minmax regret inverse maximum weight problem
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
• Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
• Approximation algorithms for capacitated partial inverse maximum spanning tree problem
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• Algorithm for constraint partial inverse matroid problem with weight increase forbidden
• Partial inverse maximum spanning tree problem under the Chebyshev norm
• Complexity of partial inverse assignment problem and partial inverse cut problem

This page was built for publication: Algorithms for the partial inverse matroid problem in which weights can only be increased

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q312484)