On the transportation problem with market choice
From MaRDI portal
Publication:479018
DOI10.1016/j.dam.2014.09.008zbMath1311.90074OpenAlexW2024486250MaRDI QIDQ479018
Pelin Damcı-Kurt, Santanu S. Dey, Simge Küçükyavuz
Publication date: 5 December 2014
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.728.3850
Related Items (4)
Multi-objective two-stage grey transportation problem using utility function with goals ⋮ Approximation algorithms for the transportation problem with market choice and related models ⋮ On a cardinality-constrained transportation problem with market choice ⋮ Solving a Mathematical Model for Small Vegetable Sellers in India by a Stochastic Knapsack Problem: An Advanced Genetic Algorithm Based Approach
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximation algorithms for supply chain planning and logistics problems with market choice
- Integrated market selection and production planning: complexity and solution approaches
- Cover and pack inequalities for (mixed) integer programming
- Polyhedral proof methods in combinatorial optimization
- Submodularity and valid inequalities in capacitated fixed charge networks
- Constrained weighted matchings and edge coverings in graphs
- The complementary class of generalized flow cover inequalities
- On the \(0/1\) knapsack polytope
- Lifted flow cover inequalities for mixed \(0\)-\(1\) integer programs
- Improved approximation algorithms for capacitated facility location problems
- A strongly polynomial algorithm for the transportation problem
- A cutting plane algorithm for minimum perfect 2-matchings
- Separation algorithms for 0-1 knapsack polytopes
- Reductions to 1–matching polyhedra
- Inventory and Facility Location Models with Market Selection
- Odd Minimum Cut Sets and b-Matchings Revisited
- Valid Linear Inequalities for Fixed Charge Problems
- Odd Minimum Cut-Sets and b-Matchings
- Flow pack facets of the single node fixed-charge flow polytope
This page was built for publication: On the transportation problem with market choice