Novel dual discounting functions for the Internet shopping optimization problem: new algorithms

DOI10.1007/s10951-014-0390-0zbMath1347.90033OpenAlexW1992560118WikidataQ57387694 ScholiaQ57387694MaRDI QIDQ310335

Pierre-Francois Dutot, Jedrzej Musial, Denis Trystram, Nathanael Cheriere, Jacek Błażewicz

Publication date: 8 September 2016

Published in: Journal of Scheduling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10951-014-0390-0

zbMATH Keywords

optimizationalgorithmscomputational complexityapplicationsinternet shopping

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Deterministic scheduling theory in operations research (90B35) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Discrete location and assignment (90B80)

Related Items (3)

Trustworthy online shopping with price impact ⋮ Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs ⋮ The clever shopper problem

Cites Work

• Internet shopping with price sensitive discounts
• Discrete location problems with push-pull objectives
• A generalized Weiszfeld method for the multi-facility location problem
• Facility location and supply chain management. A review
• A bibliography for some fundamental problem categories in discrete location science
• Internet shopping optimization problem
• Handbook on Scheduling
• Unnamed Item
• Unnamed Item

This page was built for publication: Novel dual discounting functions for the Internet shopping optimization problem: new algorithms