Network-based approximate linear programming for discrete optimization
From MaRDI portal
Recommendations
- Approximate linear programming for networks: average cost bounds
- Reductions of approximate linear programs for network revenue management
- Technical note -- Product-based approximate linear programs for network revenue management
- On the approximate linear programming approach for network revenue management problems
- Technical note: A note on relaxations of the choice network revenue management dynamic program
Cites work
- A cycle-based formulation and valid inequalities for DC power transmission problems with switching
- A dynamic programming heuristic for the quadratic knapsack problem
- A dynamic traveling salesman problem with stochastic arc costs
- A Price-Directed Approach to Stochastic Inventory/Routing
- A unified framework for the scheduling of guaranteed targeted display advertising under reach and frequency requirements
- A unifying approximate dynamic programming model for the economic lot scheduling problem
- Aggregation and Disaggregation Techniques and Methodology in Optimization
- Aggregation in Dynamic Programming
- An approximate dynamic programming approach to multidimensional knapsack problems
- Approximate Dynamic Programming
- Approximate Dynamic Programming via a Smoothed Linear Program
- Column generation for extended formulations
- Decision diagrams for optimization
- Dynamic constraint and variable aggregation in column generation
- Dynamic programming and optimal control. Vol. 1.
- Dynamic programming and optimal control. Vol. 2
- Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
- Extended formulations in combinatorial optimization
- Finite-State Processes and Dynamic Programming
- Generalized Bundle Methods
- Generalized polynomial approximations in Markovian decision processes
- Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
- How to pack your items when you have to buy your knapsack
- Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
- Multi-phase dynamic constraint aggregation for set partitioning type problems
- Multivalued decision diagrams for sequencing problems
- New route relaxation and pricing strategies for the vehicle routing problem
- New state-space relaxations for solving the traveling salesman problem with time windows
- On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
- On the approximate linear programming approach for network revenue management problems
- On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study
- Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem
- Reductions of approximate linear programs for network revenue management
- Scheduling position-dependent maintenance operations
- Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
- Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
- Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
- Solving talent scheduling with dynamic programming
- State-space relaxation procedures for the computation of bounds to routing problems
- The Linear Programming Approach to Approximate Dynamic Programming
- The machine learning and traveling repairman problem
- Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
- Warehouse-Retailer Network Design Problem
Cited in
(5)- Algorithms for network piecewise-linear programs: A comparative study
- scientific article; zbMATH DE number 1186901 (Why is no real title available?)
- scientific article; zbMATH DE number 60242 (Why is no real title available?)
- Decision Diagrams for Discrete Optimization: A Survey of Recent Advances
- A network approach for specially structured linear programs arising in 0-1 quadratic optimization
This page was built for publication: Network-based approximate linear programming for discrete optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5144795)
