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

DOI10.1007/s10898-016-0412-xzbMath1390.90454OpenAlexW2276896195MaRDI QIDQ312484

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

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

zbMATH Keywords

constrained optimizationpolynomial time algorithmmatroidpartial inverse problem

Mathematics Subject Classification ID

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

Related Items

Algorithm for constraint partial inverse matroid problem with weight increase forbidden ⋮ Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm ⋮ Approximation algorithms for capacitated partial inverse maximum spanning tree problem ⋮ Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance ⋮ Partial inverse maximum spanning tree in which weight can only be decreased under \(l_p\)-norm ⋮ The minmax regret inverse maximum weight problem ⋮ Capacitated partial inverse maximum spanning tree under the weighted Hamming distance ⋮ Partial inverse maximum spanning tree problem under the Chebyshev norm

Cites Work

• Unnamed Item
• Unnamed Item
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems
• On an instance of the inverse shortest paths problem
• The base-matroid and inverse combinatorial optimization problems.
• Inverse combinatorial optimization: a survey on problems, methods, and results
• 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 withL₁-norm is strongly NP-hard
• Encyclopedia of Optimization
• Inverse Optimization
• A weighted matroid intersection algorithm
• Robust partial inverse network flow problems

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