Modeling multiple plant sourcing decisions

DOI10.1080/00207540600990754zbMath1178.90125OpenAlexW1966277833MaRDI QIDQ3532786

Natalie S. Cherbaka, Russell D. Meller

Publication date: 28 October 2008

Published in: International Journal of Production Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/00207540600990754

zbMATH Keywords

multidimensional knapsack problemsourcing decisionsmultiple plantsmultiple-choice multidimensional knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Production models (90B30) Combinatorial optimization (90C27)

Cites Work

• A heuristic algorithm for the multidimensional zero-one knapsack problem
• Zero-one programming with many variables and few constraints
• A genetic algorithm for the multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem: an overview.
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• Towards the real time solution of strike force asset allocation problems
• Improved results on the 0--1 multidimensional knapsack problem
• Dynamic tabu list management using the reverse elimination method
• Balancing and optimizing a portfolio of R&D projects
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• Optimal Stock Allocation for a Capacitated Supply System
• Discrete Dynamic Programming and Capital Allocation
• A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• Pivot and Complement–A Heuristic for 0-1 Programming
• A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems
• A multidimensional knapsack model for asset-backed securitization
• Heuristic algorithms for the multiple-choice multidimensional knapsack problem
• The continuous-time single-sourcing problem with capacity expansion opportunities
• The Theory and Computation of Knapsack Functions

This page was built for publication: Modeling multiple plant sourcing decisions