Branch-and-cut-and-price for multi-agent path finding (Q2147092): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Partial Expansion A* / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nutmeg: a MIP and CP hybrid solver using branch-and-check / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projection results for vehicle routing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pairwise symmetry reasoning for multi-agent path finding search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Propagation via lazy clause generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3583114 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conflict-based search for optimal multi-agent pathfinding / rank
 
Normal rank

Latest revision as of 09:53, 29 July 2024

scientific article
Language Label Description Also known as
English
Branch-and-cut-and-price for multi-agent path finding
scientific article

    Statements

    Branch-and-cut-and-price for multi-agent path finding (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    22 June 2022
    0 references
    multi-agent path finding
    0 references
    multi-agent planning
    0 references
    column generation
    0 references
    cutting plane
    0 references
    valid inequality
    0 references
    0 references
    0 references

    Identifiers