On a cardinality-constrained transportation problem with market choice

DOI10.1016/j.orl.2015.12.001zbMath1408.90204arXiv1412.8723OpenAlexW1812288025MaRDI QIDQ1785735

Simge Küçükyavuz, Pelin Damcı-Kurt, Santanu S. Dey, Matthias Walter

Publication date: 1 October 2018

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.8723

zbMATH Keywords

cardinality constraintintegral polytopetransportation problem with market choice

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06)

Related Items (3)

Decentralized algorithms for distributed integer programming problems with a coupling cardinality constraint ⋮ Analyzing a two-staged multi-objective transportation problem under quantity dependent credit period policy using \(q\)-fuzzy number ⋮ Extended formulations for vertex cover

Cites Work

• Unnamed Item
• On the transportation problem with market choice
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Approximation algorithms for supply chain planning and logistics problems with market choice
• Integrated market selection and production planning: complexity and solution approaches
• On certain polytopes associated with graphs
• Approximation algorithms for the transportation problem with market choice and related models
• Inventory and Facility Location Models with Market Selection

This page was built for publication: On a cardinality-constrained transportation problem with market choice