The pricing problem. Part I: Exact and approximate algorithms
- 1 April 2013
- journal article
- Published by Pleiades Publishing Ltd in Journal of Applied and Industrial Mathematics
- Vol. 7 (2) , 241-251
Abstract
In the article we consider the pricing problem and show it to be NP-hard in the strong sense. Some exact and approximate algorithms are developed based on decomposition, genetic local search, and tabu search. The results of some computational experiments are provided.Keywords
This publication has 17 references indexed in Scilit:
- Hybrid Optimization2010
- Heuristic and Exact Methods for the Discrete (r |p)-Centroid Problem2010
- A Hybrid Memetic Algorithm for the Competitive p-Median ProblemIFAC Proceedings Volumes, 2009
- Pricing bridges to cross a riverNaval Research Logistics (NRL), 2007
- Constraint Processing2003
- Foundations of Bilevel Programming2002
- Optimization Methods for Logical Inference1999
- Uncapacitated Plant Location Under Alternative Spatial Price PoliciesManagement Science, 1990
- Large-scale mixed integer programming: Benders-type heuristicsEuropean Journal of Operational Research, 1984
- Generalized Benders decompositionJournal of Optimization Theory and Applications, 1972