Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands

Cites Work

Unnamed Item
Optimization by Simulated Annealing
Late acceptance hill-climbing for high school timetabling
A review of multi-product pricing models
An inventory system with demand dependent on both time and price assuming backlogged shortages
Pricing and lot-sizing decisions for perishable goods when demand depends on selling price, reference price, product freshness, and displayed stocks
Meta-heuristics for dynamic lot sizing: a review and comparison of solution approaches
An algorithmic framework for convex mixed integer nonlinear programs
Variable neighborhood search
Heuristic genetic algorithms for general capacitated lot-sizing problems
The late acceptance hill-climbing heuristic
Review of nonlinear mixed-integer and disjunctive programming techniques
Joint optimization of dynamic pricing and lot-sizing decisions with nonlinear demands: theoretical and computational analysis
Generalized Benders decomposition
Dynamic pricing models for electronic business
SATenstein: automatically building local search SAT solvers from components
Dynamic Version of the Economic Lot Size Model
A genetic algorithm heuristic approach to general outsourcing capacitated production planning problems
ParamILS: An Automatic Algorithm Configuration Framework
Optimal Lot-Sizing Algorithms for Complex Product Structures
An outer-approximation algorithm for a class of mixed-integer nonlinear programs
Deterministic Production Planning: Algorithms and Complexity
Computational Complexity of the Capacitated Lot Size Problem
Adaptive Penalty Methods for Genetic Optimization of Constrained Combinatorial Problems
Price-Production Decisions with Deterministic Demand

This page was built for publication: Matheuristics vs. metaheuristics for joint lot-sizing and dynamic pricing problem with nonlinear demands