Modeling multiple plant sourcing decisions

DOI10.1080/00207540600990754MaRDI QIDQ3532786zbMATH OpenOpenAlexFDO

Authors Natalie S. Cherbaka, R. 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

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

Recommendations

• scientific article; zbMATH DE number 3874947
• Global plant capacity and product allocation with pricing decisions
• Publication:3468897
• An integrated plant loading model with economies of scale and scope
• Decision models for sustainable supply chain design and management
• A tactical model for planning the production and distribution of fresh produce
• Mixed integer linear programming models for optimal crop selection
• A two-stage stochastic programming with recourse model for determining robust planting plans in horticulture

Cites work

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3532786)