Adjacency on polymatroids

DOI10.1007/BF02591887MaRDI QIDQ3335528zbMATHFDO

Authors Donald M. Topkis

Publication date 1984

Published in Mathematical Programming (Search for Journal in Brave)

zbMATH Keywords

submodular functionpolymatroidpolynomial algorithmconvex gameadjacency for extreme points

Mathematics Subject Classification ID

Integer programming (90C10) Polytopes and polyhedra (52Bxx) Combinatorial aspects of matroids and geometric lattices (05B35)

Recommendations

• The Partial Order of a Polymatroid Extreme Point
• An extreme point theorem for ordered polymatroids on chain orders
• A polymatroid associated with convex games
• On matroid intersection adjacency
• scientific article; zbMATH DE number 3906513

Cites work

• scientific article; zbMATH DE number 3659288 (Why is no real title available?)
• scientific article; zbMATH DE number 3659595 (Why is no real title available?)
• scientific article; zbMATH DE number 3687081 (Why is no real title available?)
• scientific article; zbMATH DE number 3749025 (Why is no real title available?)
• scientific article; zbMATH DE number 3628719 (Why is no real title available?)
• scientific article; zbMATH DE number 3422402 (Why is no real title available?)
• ALGORITHMS FOR SOLVING THE INDEPENDENT-FLOW PROBLEMS
• Activity selection games and the minimum‐cut problem
• Adjacency of the Traveling Salesman Tours and $0 - 1$ Vertices
• Adjacency on Convex Polyhedra
• Adjacency on the Postman Polyhedron
• Adjacent Vertices on a Permutohedron
• Adjacent vertices of the all 0-1 programming polytope
• Adjacent vertices on the b-matching polyhedron
• Adjacent vertices on transportation polytopes
• Characterizations of adjacency on the branching polyhedron
• Cores of convex games
• Determining adjacent vertices on assignment polytopes
• On certain polytopes associated with graphs
• On the Set-Covering Problem
• On the Set-Covering Problem: II. An Algorithm for Set Partitioning
• On the Tours of a Traveling Salesman
• Some properties of the assignment polytope
• The Partial Order of a Polymatroid Extreme Point
• The adjacency relation on the traveling salesman polytope is NP-Complete
• The ellipsoid method and its consequences in combinatorial optimization
• The travelling salesman problem and a class of polyhedra of diameter two

Cited in

(17)

• The polytope of win vectors
• The Partial Order of a Polymatroid Extreme Point
• A note on Frank's generalized polymatroids
• On the expansion of combinatorial polytopes
• Adjacency polynomials of digraph transformations
• Extended formulations for matroid polytopes through randomized protocols
• The fundamental theorem of linear programming: extensions and applications
• Ehrhart polynomials of matroid polytopes and polymatroids
• On the length of monotone paths in polyhedra
• Generalized polymatroids and submodular flows
• Paths on polymatroids
• Circuit walks in integral polyhedra
• One-adhesive polymatroids.
• Two algorithms for maximizing a separable concave function over a polymatroid feasible region
• scientific article; zbMATH DE number 3906512 (Why is no real title available?)
• A normal fan projection algorithm for low-rank optimization
• Adjacency on the order polytope with applications to the theory of fuzzy measures

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)