Internet shopping with price sensitive discounts
From MaRDI portal
Publication:457290
DOI10.1007/s10288-013-0230-7zbMath1297.90183OpenAlexW2012872784WikidataQ57387705 ScholiaQ57387705MaRDI QIDQ457290
Pascal Bouvry, Jedrzej Musial, Mikhail Y. Kovalyov, Jacek Błażewicz
Publication date: 26 September 2014
Published in: 4OR (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10288-013-0230-7
Analysis of algorithms and problem complexity (68Q25) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (7)
Trustworthy online shopping with price impact ⋮ Novel dual discounting functions for the Internet shopping optimization problem: new algorithms ⋮ Exact and heuristic approaches to solve the Internet shopping optimization problem with delivery costs ⋮ A hybrid dynamic programming for solving fixed cost transportation with discounted mechanism ⋮ Scheduling on parallel identical machines with late work criterion: offline and online cases ⋮ Erratum to: ``Internet shopping with price-sensitive discounts ⋮ The clever shopper problem
Cites Work
- Unnamed Item
- Unnamed Item
- 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 Lagrangean heuristic for the facility location problem with staircase costs
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- A bibliography for some fundamental problem categories in discrete location science
- An Automatic Method of Solving Discrete Programming Problems
- Internet shopping optimization problem
- Optimal Facility Location with Concave Costs
This page was built for publication: Internet shopping with price sensitive discounts
