Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
type: Item
instance of: scholarly article
title: Novel dual discounting functions for the Internet shopping optimization problem: new algorithms
zbMATH Open document ID: 1347.90033
author: Nathanael Cheriere
author: Pierre-Francois Dutot
author: Jedrzej Musial
author: Denis Trystram
author: Jacek Blazewicz
published in: Journal of Scheduling
publication date: 2016-09-08T00:00:00Z
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 6625283
zbMATH Keywords: internet shopping
zbMATH Keywords: algorithms
zbMATH Keywords: optimization
zbMATH Keywords: computational complexity
zbMATH Keywords: applications
MaRDI profile type: Publication
full work available at URL: s10951-014-0390-0
OpenAlex ID: W1992560118
Wikidata QID: Q57387694
cites work: Internet shopping with price sensitive discounts
cites work: Handbook on Scheduling
cites work: Internet shopping optimization problem
cites work: A bibliography for some fundamental problem categories in discrete location science
cites work: Q4831220
cites work: A generalized Weiszfeld method for the multi-facility location problem
cites work: Discrete location problems with push-pull objectives
cites work: Q4821818
cites work: Facility location and supply chain management. A review
DOI: 10.1007/S10951-014-0390-0
description: scientific article; zbMATH DE number 6625283