Algorithm for constraint partial inverse matroid problem with weight increase forbidden

DOI10.1016/J.TCS.2016.06.002zbMATH Open1345.05011OpenAlexW2436549743MaRDI QIDQ2629239FDOQ2629239

Authors: Shuangshuang Li, Zhao Zhang, Hong-Jian Lai 

Publication date: 5 July 2016

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2016.06.002

Recommendations

• Algorithms for the partial inverse matroid problem in which weights can only be increased
• The partial inverse minimum spanning tree problem when weight increase is forbidden
• Inverse matroid optimization problem under the weighted Hamming distances
• A weighted linear matroid parity algorithm
• A weighted linear matroid parity algorithm
• Combinatorial algorithms for solving the restricted bounded inverse optimal value problem on minimum spanning tree under weighted \(l_\infty\) norm
• An algebraic algorithm for weighted linear matroid intersection
• On the inverse problem of linear programming and its application to minimum weight perfect \(k\)-matching
• scientific article; zbMATH DE number 1159475
• scientific article; zbMATH DE number 1559133

zbMATH Keywords

matroidpolynomial time algorithmweight constraintpartial inverse optimization problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Nonnumerical algorithms (68W05) 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
• Inverse Optimization
• Matroids and the greedy algorithm
• 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
• The partial inverse minimum cut problem with \(L_1\)-norm is strongly NP-hard
• Title not available (Why is that?)
• Algorithms for the partial inverse matroid problem in which weights can only be increased
• Inverse sorting problem by minimizing the total weighted number of changes and partial inverse sorting problems

Cited In (14)

• Inverse optimization problems with multiple weight functions
• 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 lower bounded inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
• Inverse optimal value problem on minimum spanning tree under unit \(l_{\infty}\) norm
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance
• Algorithms for the partial inverse matroid problem in which weights can only be increased
• Capacitated partial inverse maximum spanning tree under the weighted \(l_{\infty }\)-norm
• Capacitated inverse optimal value problem on minimum spanning tree under bottleneck Hamming distance
• Approximation algorithms for capacitated partial inverse maximum spanning tree problem
• Capacitated partial inverse maximum spanning tree under the weighted Hamming distance
• Inverse max+sum spanning tree problem under weighted \(l_{\infty}\) norm by modifying max-weight vector
• Partial inverse maximum spanning tree problem under the Chebyshev norm
• Partial inverse min-max spanning tree problem under the weighted bottleneck Hamming distance

This page was built for publication: Algorithm for constraint partial inverse matroid problem with weight increase forbidden

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