Heuristics for the mixed swapping problem (Q733528): Difference between revisions

From MaRDI portal
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.cor.2009.03.032 / 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.1016/j.cor.2009.03.032 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2139110007 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Swapping Problem on a Line / rank
 
Normal rank
Property / cites work
 
Property / cites work: The preemptive swapping problem on a tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Solutions to Some Transportation Problems with Applications to Minimizing Robot Arm Travel / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch-and-cut algorithm for the preemptive swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch‐and‐cut algorithm for the nonpreemptive swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Capacitated Routing and Delivery Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Minimum-Weight Perfect Matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the mixed rural postman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preemptive Ensemble Motion Planning on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nonpreemptive Ensemble Motion Planning on a Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the shortest spanning subtree of a graph and the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519710 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for the Assignment and Transportation Problems / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.COR.2009.03.032 / rank
 
Normal rank

Latest revision as of 02:28, 10 December 2024

scientific article
Language Label Description Also known as
English
Heuristics for the mixed swapping problem
scientific article

    Statements

    Heuristics for the mixed swapping problem (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2009
    0 references
    transportation problem
    0 references
    vehicle routing
    0 references
    heuristic
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers