Logistics & Supply Chain Management: Faculty Presentations (1998-2020)
Branch and Bound Algorithm for the Separable Piecewise Linear Concave Cost Allocation Problem
Document Type
Presentation
Presentation Date
5-2007
Copyright
This work is archived and distributed under the repository's Standard Copyright and Reuse License (opens in new tab). End users may copy, store, and distribute this work without restriction. For all other uses, permission must be obtained from the copyright owners or their authorized agents.
Abstract or Description
This presentation was given at the Production and Operations Management Annual Conference (POMS).
Sponsorship/Conference/Institution
Production and Operations Management Society Annual Conference (POMS)
Location
Dallas, TX
Recommended Citation
Burke, Gerard, S. Selcuk Erenguc, Asoo J. Vakharia.
2007.
"Branch and Bound Algorithm for the Separable Piecewise Linear Concave Cost Allocation Problem."
Logistics & Supply Chain Management: Faculty Presentations (1998-2020).
Presentation 20.
https://digitalcommons.georgiasouthern.edu/logistics-supply-facpres/20
