Computation in multicriteria matroid optimization

Authors:
Jesús A. De Loera;David C. Haws;Jon Lee;Allison O'Hair
Affiliations:
University of California, Davis, CA;University of California, Davis, CA;IBM T.J. Watson Research Center, Yorktown Heights, NY;University of California, Davis, CA
Venue:
Journal of Experimental Algorithmics (JEA)
Year:
2010

Citing 7
Cited 0

Future paths for integer programming and links to artificial intelligence

Computers and Operations Research - Special issue: Applications of integer programming
LAPACK Users' guide (third ed.)

LAPACK Users' guide (third ed.)
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Convex Matroid Optimization

SIAM Journal on Discrete Mathematics
Nonlinear Matroid Optimization and Experimental Design

SIAM Journal on Discrete Mathematics
A polynomial-time-delay and polynomial-space algorithm for enumeration problems in multi-criteria optimization

ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Nonlinear bipartite matching

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.