A bilinear reduction based algorithm for solving capacitated multi-item dynamic pricing problems
From MaRDI portal
Publication:2459395
DOI10.1016/j.cor.2006.09.003zbMath1278.90050OpenAlexW1964269138MaRDI QIDQ2459395
Artyom Nahapetyan, Panos M. Pardalos
Publication date: 6 November 2007
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2006.09.003
Mixed integer programming (90C11) Transportation, logistics and supply chain management (90B06) Inventory, storage, reservoirs (90B05)
Related Items
Pricing and lot sizing for an EPQ inventory model with rework and multiple shipments, A review of recent advances in global optimization, Degeneracy removal in cutting plane methods for disjoint bilinear programming
Cites Work
- Unnamed Item
- Unnamed Item
- Cutting planes in integer and mixed integer programming
- Coordiantion of pricing and multi-period production for constant priced goods
- A solution approach to the fixed charge network flow problem using a dynamic slope scaling procedure
- Dynamic knapsack sets and capacitated lot-sizing
- Tight formulations for some simple mixed integer programs and convex objective integer programs
- A bilinear relaxation based algorithm for concave piecewise linear network flow problems
- Adaptive dynamic cost updating procedure for solving fixed charge network flow problems
- Solving Multi-Item Lot-Sizing Problems with an MIP Solver Using Classification and Reformulation
- Some branch-and-bound procedures for fixed-cost transportation problems
- Requirements Planning with Pricing and Order Selection Flexibility
- Optimal short-term scheduling of large-scale power systems
- An approximative algorithm for the fixed-charges transportation problem
- A finitely convergent algorithm for bilinear programming problems using polar cuts and disjunctive face cuts
- A New Optimization Method for Large Scale Fixed Charge Transportation Problems
- Approximate solutions of capacitated fixed-charge minimum cost network flow problems
- Successive Linear Approximation Procedure for Generalized Fixed-Charge Transportation Problems
- A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
- Global optimization using special ordered sets
- A cutting plane algorithm for solving bilinear programs
- Dynamic slope scaling and trust interval techniques for solving concave piecewise linear network flow problems
- An O(T3) Algorithm for the Economic Lot-Sizing Problem with Constant Capacities
- Deterministic Production Planning with Concave Costs and Capacity Constraints
- An approximate solution method for the fixed charge problem
- Price-Production Decisions with Deterministic Demand
- Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
- Fully Polynomial Approximation Schemes for Single-Item Capacitated Economic Lot-Sizing Problems
- A Branch-and-Bound Method for the Fixed Charge Transportation Problem
- Introduction to global optimization.
- The uncapacitated lot-sizing problem with sales and safety stocks
