On a cardinality-constrained transportation problem with market choice
From MaRDI portal
(Redirected from Publication:1785735)
Abstract: It is well-known that the intersection of the matching polytope with a cardinality constraint is integral [8]. We prove a similar result for the polytope corresponding to the transportation problem with market choice (TPMC) (introduced in [4]) when the demands are in the set . This result generalizes the result regarding the matching polytope and also implies that some special classes of minimum weight perfect matching problem with a cardinality constraint on a subset of edges can be solved in polynomial time.
Recommendations
Cites work
- Approximation algorithms for supply chain planning and logistics problems with market choice
- Approximation algorithms for the transportation problem with market choice and related models
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- scientific article; zbMATH DE number 3862930 (Why is no real title available?)
- Integrated market selection and production planning: complexity and solution approaches
- Inventory and Facility Location Models with Market Selection
- On certain polytopes associated with graphs
- On the transportation problem with market choice
Cited in
(5)- Extended formulations for vertex cover
- Analyzing a two-staged multi-objective transportation problem under quantity dependent credit period policy using \(q\)-fuzzy number
- Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint
- On the transportation problem with market choice
- Intra market optimization for express package carriers with station to station travel and proportional sorting
This page was built for publication: On a cardinality-constrained transportation problem with market choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1785735)