Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (Q1751662): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2531214128 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for a single-vehicle routing problem with time windows and multiple routes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving network design problems via iterative aggregation / 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: LP models for bin packing and cutting stock problems / 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: Bin packing and cutting stock problems: mathematical models and exact algorithms / 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: Dynamic Aggregation of Set-Partitioning Constraints in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: `` Strong '' NP-Completeness Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / 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: 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: New dynamic programming algorithms for the resource constrained elementary shortest path problem / 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: Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Investigation of Aggregation in Pseudo-polynomial Network-Flow Models / rank
 
Normal rank

Revision as of 16:47, 15 July 2024

scientific article
Language Label Description Also known as
English
Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints
scientific article

    Statements

    Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    25 May 2018
    0 references
    integer programming
    0 references
    arc-flow integer models
    0 references
    aggregation of integer models
    0 references
    combinatorial optimization
    0 references

    Identifiers

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