Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(5 intermediate revisions by 5 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2021.04.024 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: VRP / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3091309232 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 2010.00558 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3056948 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Indexed Formulations for Machine Scheduling Problems: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dual-Optimal Inequalities for Stabilized Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Continuous-Time Service Network Design Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Perspectives on integer programming for time-dependent models / 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: A pseudopolynomial network flow formulation for exact knapsack separation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and related problems: general arc-flow formulation with graph compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exact solution of a large class of parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nominal and robust train timetabling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Friendly bin packing instances without integer round-up property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling and Solving the Train Timetabling Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vehicle routing problems with multiple trips / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts / 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: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extended formulations in combinatorial optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Meet-in-the-Middle Principle for Cutting and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Decomposition Algorithm for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical models and decomposition methods for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic based Benders' decomposition for orthogonal stock cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Linear Programming Approach to the Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Primal Simplex Algorithm for Degenerate Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Aggregation of Set-Partitioning Constraints in Column Generation / 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: Dynamic graph generation for the shortest path problem in time expanded networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Suggested Computation for Maximal Multi-Commodity Network Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing Maximal Dynamic Flows from Static Flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452994 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layered graph approaches for combinatorial optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization and Approximation in Deterministic Sequencing and Scheduling: a Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of Graph Coloring Problems via Constraint Programming and Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph Coloring Lower Bounds from Decision Diagrams / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision Diagrams and Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal proper non-IRUP instances of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling jobs with release dates on identical parallel machines by minimizing the total weighted completion time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced arc-flow formulations to minimize weighted completion time on identical parallel machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical formulations for scheduling jobs on identical parallel machines with family setup times and total weighted completion time minimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Novel formulations and modeling enhancements for the dynamic berth allocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Models and Search Algorithms for the Capacitated <i>p</i>-Center Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time-indexed LP-based approach for min-sum job-shop problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deriving compact extended formulations via LP-based separation techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4735938 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-flow model for the two-dimensional guillotine cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral Characterization of Discrete Dynamic Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved flow-based formulations for the skiving stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The proper relaxation and the proper gap of the skiving stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming models for the skiving stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stabilized column generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming Formulation of Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5294047 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved branch-cut-and-price for capacitated vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust Branch-Cut-and-Price Algorithms for Vehicle Routing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generic exact solver for Vehicle Routing and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithm over an arc-time-indexed formulation for parallel machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Time-Dependent Traveling Salesman Problem and Its Application to the Tardiness Problem in One-Machine Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: An iterative time‐bucket refinement algorithm for a high‐resolution resource‐constrained project scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact approach based on a new pseudo-polynomial network flow model for integrated planning and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: New dynamic programming algorithms for the resource constrained elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column generation for extended formulations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer programming model for two- and three-stage two-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Introduction to Network Flows over Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: A time indexed formulation of non-preemptive single machine scheduling problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3109941 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP models for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Extra Dual Cuts to Accelerate Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4354953 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145427 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2021.04.024 / rank
 
Normal rank

Latest revision as of 15:27, 17 December 2024

scientific article
Language Label Description Also known as
English
Arc flow formulations based on dynamic programming: theoretical foundations and applications
scientific article

    Statements

    Arc flow formulations based on dynamic programming: theoretical foundations and applications (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 November 2021
    0 references
    combinatorial optimization
    0 references
    arc flow
    0 references
    dynamic programming
    0 references
    acyclic network
    0 references
    pseudo-polynomial
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references