Network-Based Approximate Linear Programming for Discrete Optimization (Q5144795): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1287/opre.2019.1953 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: Gurobi / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1287/opre.2019.1953 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2778922089 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Price-Directed Approach to Stochastic Inventory/Routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Pack Your Items When You Have to Buy Your Knapsack / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: New State-Space Relaxations for Solving the Traveling Salesman Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation in Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision diagrams for optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2925454 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4597712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-Infinite Relaxations for the Dynamic Knapsack Problem with Stochastic Item Sizes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic constraint and variable aggregation in column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: State-space relaxation procedures for the computation of bounds to routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivalued Decision Diagrams for Sequencing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear Programming Approach to Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Constraint Sampling in the Linear Programming Approach to Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming via a Smoothed Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling Position-Dependent Maintenance Operations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-phase dynamic constraint aggregation for set partitioning type problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multi-Item Capacitated Lot-Sizing Problems Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Programming Heuristic for the Quadratic Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Bundle Methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Talent Scheduling with Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Variable Redefinition for Computing Lower Bounds for Minimum Spanning and Steiner Trees with Hop Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Unified Framework for the Scheduling of Guaranteed Targeted Display Advertising Under Reach and Frequency Requirements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite-State Processes and Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cycle-Based Formulation and Valid Inequalities for DC Power Transmission Problems with Switching / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of nonconvex cardinality Boolean quadratic programming problems: a computational study / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating Alternative Mixed-Integer Programming Models Using Variable Redefinition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Strategies for the Traveling Salesman Problem with Time Window and Precedence Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregation and Disaggregation Techniques and Methodology in Optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column generation for extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized polynomial approximations in Markovian decision processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Warehouse-Retailer Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Approximate Linear Programming Approach for Network Revenue Management Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal toll design: a lower bound framework for the asymmetric traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Dynamic Traveling Salesman Problem with Stochastic Arc Costs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Machine Learning and Traveling Repairman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reductions of Approximate Linear Programs for Network Revenue Management / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1287/OPRE.2019.1953 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 16:06, 30 December 2024

scientific article; zbMATH DE number 7298149
Language Label Description Also known as
English
Network-Based Approximate Linear Programming for Discrete Optimization
scientific article; zbMATH DE number 7298149

    Statements

    Network-Based Approximate Linear Programming for Discrete Optimization (English)
    0 references
    0 references
    0 references
    19 January 2021
    0 references
    discrete optimization
    0 references
    approximate linear programming
    0 references
    state-space aggregation
    0 references
    networks
    0 references
    dynamic programming
    0 references
    0 references
    0 references

    Identifiers