Computation in multicriteria matroid optimization. Motivated by recent work on algorithmic theory for nonlinear and multicriteria matroid optimization, we have developed algorithms and heuristics aimed at practical solution of large instances of some of these difficult problems. Our methods primarily use the local adjacency structure inherent in matroid polytopes to pivot to feasible solutions, which may or may not be optimal. We also present a modified breadth-first-search heuristic that uses adjacency to enumerate a subset of feasible solutions. We present other heuristics and provide computational evidence supporting our techniques. We implemented all of our algorithms in the software package MOCHA.
Keywords for this software
References in zbMATH (referenced in 3 articles )
Showing results 1 to 3 of 3.
- Fischer, Anja; Fischer, Frank; McCormick, S. Thomas: Matroid optimisation problems with nested non-linear monomials in the objective function (2018)
- Gunnels, John; Lee, Jon; Margulies, Susan: Efficient high-precision matrix algebra on parallel architectures for nonlinear combinatorial optimization (2010)
- De Loera, Jesús A.; Haws, David C.; Lee, Jon; O’Hair, Allison: Computation in multicriteria matroid optimization (2009)