On the transportation problem with market choice
From MaRDI portal
Publication:479018
Recommendations
- On a cardinality-constrained transportation problem with market choice
- Approximation algorithms for the transportation problem with market choice and related models
- The transportation problem with conflicts
- The transportation problem with exclusionary side constraints
- A strongly polynomial algorithm for the transportation problem
Cites work
- scientific article; zbMATH DE number 193411 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1182577 (Why is no real title available?)
- scientific article; zbMATH DE number 3409134 (Why is no real title available?)
- A cutting plane algorithm for minimum perfect 2-matchings
- A strongly polynomial algorithm for the transportation problem
- Approximation algorithms for supply chain planning and logistics problems with market choice
- Constrained weighted matchings and edge coverings in graphs
- Cover and pack inequalities for (mixed) integer programming
- Flow pack facets of the single node fixed-charge flow polytope
- Improved approximation algorithms for capacitated facility location problems
- Integrated market selection and production planning: complexity and solution approaches
- Inventory and Facility Location Models with Market Selection
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Odd Minimum Cut Sets and b-Matchings Revisited
- Odd Minimum Cut-Sets and b-Matchings
- On the \(0/1\) knapsack polytope
- Polyhedral proof methods in combinatorial optimization
- Reductions to 1–matching polyhedra
- Separation algorithms for 0-1 knapsack polytopes
- Submodularity and valid inequalities in capacitated fixed charge networks
- The complementary class of generalized flow cover inequalities
- Valid Linear Inequalities for Fixed Charge Problems
Cited in
(4)- Solving a Mathematical Model for Small Vegetable Sellers in India by a Stochastic Knapsack Problem: An Advanced Genetic Algorithm Based Approach
- On a cardinality-constrained transportation problem with market choice
- Multi-objective two-stage grey transportation problem using utility function with goals
- Approximation algorithms for the transportation problem with market choice and related models
This page was built for publication: On the transportation problem with market choice
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q479018)
