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

Zhao Zhang (), Shuangshuang Li, Hong-Jian Lai and Ding-Zhu Du
Additional contact information
Zhao Zhang: Zhejiang Normal University
Shuangshuang Li: Xinjiang University
Hong-Jian Lai: West Virginia University
Ding-Zhu Du: University of Texas at Dallas

Journal of Global Optimization, 2016, vol. 65, issue 4, No 7, 811 pages

Abstract: Abstract In a partial inverse combinatorial problem, given a partial solution, the goal is to modify data as small as possible such that there exists an optimal solution containing the given partial solution. In this paper, we study a constraint version of the partial inverse matroid problem in which the weight can only be increased. Two polynomial time algorithms are presented for this problem.

Keywords: Partial inverse optimization problem; Matroid; Weight constraint; Polynomial time algorithm (search for similar items in EconPapers)
Date: 2016
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (5)

Downloads: (external link)
http://link.springer.com/10.1007/s10898-016-0412-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jglopt:v:65:y:2016:i:4:d:10.1007_s10898-016-0412-x

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/10898

DOI: 10.1007/s10898-016-0412-x

Access Statistics for this article

Journal of Global Optimization is currently edited by Sergiy Butenko

More articles in Journal of Global Optimization from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().