Adjacency on polymatroids
From MaRDI portal
Publication:3335528
DOI10.1007/BF02591887zbMATH Open0544.90077MaRDI QIDQ3335528FDOQ3335528
Authors: Donald M. Topkis
Publication date: 1984
Published in: Mathematical Programming (Search for Journal in Brave)
Recommendations
Integer programming (90C10) Polytopes and polyhedra (52Bxx) Combinatorial aspects of matroids and geometric lattices (05B35)
Cites Work
- Cores of convex games
- The ellipsoid method and its consequences in combinatorial optimization
- On certain polytopes associated with graphs
- Title not available (Why is that?)
- On the Set-Covering Problem
- ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
- Title not available (Why is that?)
- Adjacent Vertices on a Permutohedron
- Title not available (Why is that?)
- The travelling salesman problem and a class of polyhedra of diameter two
- The adjacency relation on the traveling salesman polytope is NP-Complete
- On the Set-Covering Problem: II. An Algorithm for Set Partitioning
- Title not available (Why is that?)
- Title not available (Why is that?)
- The Partial Order of a Polymatroid Extreme Point
- Adjacency on Convex Polyhedra
- Adjacency on the Postman Polyhedron
- Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
- Activity selection games and the minimum‐cut problem
- Characterizations of adjacency on the branching polyhedron
- Adjacent vertices on the b-matching polyhedron
- Title not available (Why is that?)
- On the Tours of a Traveling Salesman
- Adjacent vertices of the all 0-1 programming polytope
- Adjacent vertices on transportation polytopes
- Determining adjacent vertices on assignment polytopes
- Some properties of the assignment polytope
Cited In (16)
- The polytope of win vectors
- On the Length of Monotone Paths in Polyhedra
- A note on Frank's generalized polymatroids
- The fundamental theorem of linear programming: extensions and applications
- Adjacency polynomials of digraph transformations
- Two algorithms for maximizing a separable concave function over a polymatroid feasible region
- On the expansion of combinatorial polytopes
- The Partial Order of a Polymatroid Extreme Point
- Generalized polymatroids and submodular flows
- Paths on polymatroids
- Adjacency on the order polytope with applications to the theory of fuzzy measures
- A normal fan projection algorithm for low-rank optimization
- Circuit walks in integral polyhedra
- Ehrhart polynomials of matroid polytopes and polymatroids
- Title not available (Why is that?)
- Extended formulations for matroid polytopes through randomized protocols
This page was built for publication: Adjacency on polymatroids
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3335528)