Crashing a maximum-weight complementary basis
From MaRDI portal
Publication:1196719
DOI10.1007/BF01586055zbMath0764.90082OpenAlexW2052278938MaRDI QIDQ1196719
Jon Lee, Thomas F. Rutherford, Kurt M. Anstreicher
Publication date: 16 January 1993
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01586055
Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33) Combinatorial aspects of matroids and geometric lattices (05B35) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
A pathsearch damped Newton method for computing general equilibria, Reducing horizontal linear complementarity problems, Extension of GAMS for complementarity problems arising in applied economic analysis, Finding all common bases in two matroids
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A new polynomial-time algorithm for linear programming
- A matroid algorithm and its application to the efficient solution of two optimization problems on graphs
- Interior path following primal-dual algorithms. I: Linear programming
- Interior path following primal-dual algorithms. II: Convex quadratic programming
- A polynomial-time algorithm for a class of linear complementarity problems
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Maintaining LU factors of a general sparse matrix
- Matroid Intersection
- Computation of economic equilibria by a sequence of linear complementarity problems
- Computational Experience in Solving Equilibrium Models by a Sequence of Linear Complementarity Problems
- Two algorithms for weighted matroid intersection
- Intersection of Two Matroids: (Condensed) Border Graphs and Ranking
- A weighted matroid intersection algorithm
- Matroid Applications and Algorithms
- Matroid intersection algorithms
- AN ALGORITHM FOR FINDING AN OPTIMAL "INDEPENDENT ASSIGNMENT"
