Network-Based Approximate Linear Programming for Discrete Optimization

DOI10.1287/OPRE.2019.1953zbMath1457.90095OpenAlexW2778922089MaRDI QIDQ5144795

Andre A. Cire, Selvaprabu Nadarajah

Publication date: 19 January 2021

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.2019.1953

zbMATH Keywords

dynamic programmingnetworksdiscrete optimizationapproximate linear programmingstate-space aggregation

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Integer programming (90C10)

Related Items (1)

Decision Diagrams for Discrete Optimization: A Survey of Recent Advances

Uses Software

• Gurobi

Cites Work

• Unnamed Item
• Unnamed Item
• Decision diagrams for optimization
• Column generation for extended formulations
• Multi-phase dynamic constraint aggregation for set partitioning type problems
• Generalized polynomial approximations in Markovian decision processes
• Dynamic constraint and variable aggregation in column generation
• Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
• 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
• New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows
• Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes
• A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching
• How to Pack Your Items When You Have to Buy Your Knapsack
• New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem
• Solving Talent Scheduling with Dynamic Programming
• A Dynamic Traveling Salesman Problem with Stochastic Arc Costs
• On the Approximate Linear Programming Approach for Network Revenue Management Problems
• A Dynamic Programming Heuristic for the Quadratic Knapsack Problem
• The Machine Learning and Traveling Repairman Problem
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
• Aggregation and Disaggregation Techniques and Methodology in Optimization
• The Linear Programming Approach to Approximate Dynamic Programming
• Warehouse-Retailer Network Design Problem
• Aggregation in Dynamic Programming
• Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition
• Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition
• State-space relaxation procedures for the computation of bounds to routing problems
• Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints
• Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints
• Scheduling Position-Dependent Maintenance Operations
• Approximate Dynamic Programming via a Smoothed Linear Program
• Generalized Bundle Methods
• Multivalued Decision Diagrams for Sequencing Problems
• A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem
• A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements
• Approximate Dynamic Programming
• A Price-Directed Approach to Stochastic Inventory/Routing
• Finite-State Processes and Dynamic Programming
• On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming
• Extended formulations in combinatorial optimization

This page was built for publication: Network-Based Approximate Linear Programming for Discrete Optimization