The pricing problem. Part I: Exact and approximate algorithms

DOI10.1134/S1990478913020142zbMath1324.68048OpenAlexW2086234016MaRDI QIDQ5263791

A. A. Panin, Aleksandr V. Plyasunov

Publication date: 17 July 2015

Published in: Journal of Applied and Industrial Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1990478913020142

zbMATH Keywords

decompositiontabu searchlocal searchminimax problemgenetic algorithmhybrid algorithmbilevel problempricing problemNP-hard in the strong sense

Mathematics Subject Classification ID

Microeconomic theory (price theory and economic markets) (91B24) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

A bilevel planning model for public-private partnership ⋮ Comparison of metaheuristics for the bilevel facility location and mill pricing problem ⋮ A capacitated competitive facility location problem ⋮ The multilevel facility location and pricing problems: the computational complexity and the stability analysis ⋮ On the competitive facility location problem with a free choice of suppliers ⋮ Bilevel competitive facility location and pricing problems ⋮ On a Three-Level Competitive Pricing Problem with Uniform and Mill Pricing Strategies ⋮ On complexity of the bilevel location and pricing problems

This page was built for publication: The pricing problem. Part I: Exact and approximate algorithms