A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (Q602676): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.dam.2010.05.025 / rank
Normal rank
 
Property / describes a project that uses
 
Property / describes a project that uses: TSPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2010.05.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2055044850 / 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: The swapping problem / 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: Heuristics for the mixed swapping problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An inexact algorithm for the sequential ordering problem / 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: A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery / rank
 
Normal rank
Property / cites work
 
Property / cites work: The one‐commodity pickup‐and‐delivery traveling salesman problem: Inequalities and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-commodity one-to-one pickup-and-delivery traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equivalent weights for lexicographic multi-objective programs: Characterizations and computations / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.DAM.2010.05.025 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:57, 9 December 2024

scientific article
Language Label Description Also known as
English
A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem
scientific article

    Statements

    A branch-and-cut algorithm for solving the Non-preemptive Capacitated Swapping Problem (English)
    0 references
    0 references
    0 references
    0 references
    5 November 2010
    0 references
    swapping problem
    0 references
    robot arm travel
    0 references
    non-preemptive
    0 references
    capacitated
    0 references
    mathematical programming
    0 references
    branch-and-cut
    0 references

    Identifiers