scientific article
From MaRDI portal
Publication:2861535
zbMath1274.90423MaRDI QIDQ2861535
Marta M. Casetti, Julian Merschen, Bernhard von Stengel
Publication date: 8 November 2013
Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571065310001368
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Related Items (2)
Exponentiality of the exchange algorithm for finding another room-partitioning ⋮ Oriented Euler complexes and signed perfect matchings
Cites Work
- Formality of the constructible derived category for spheres: a combinatorial and a geometric approach
- On the complexity of the parity argument and other inefficient proofs of existence
- Simple complexity from imitation games
- The complexity of computing a Nash equilibrium
- Orientation in Complementary Pivot Algorithms
- On generalizing shapley's index theory to labelled pseudomanifolds
- Lemke Paths on Simple Polytopes
- Equilibrium Points of Bimatrix Games
- Paths, Trees, and Flowers
- Hard-to-Solve Bimatrix Games
- Unnamed Item
- Unnamed Item
This page was built for publication:
