A new formulation and approach for the black and white traveling salesman problem (Q337265): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C57 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6650767 / rank
 
Normal rank
Property / zbMATH Keywords
 
traveling salesman problem
Property / zbMATH Keywords: traveling salesman problem / rank
 
Normal rank
Property / zbMATH Keywords
 
column generation
Property / zbMATH Keywords: column generation / rank
 
Normal rank
Property / zbMATH Keywords
 
branch-and-price
Property / zbMATH Keywords: branch-and-price / rank
 
Normal rank
Property / zbMATH Keywords
 
cutting planes
Property / zbMATH Keywords: cutting planes / 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.2014.07.019 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1978514218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Route Relaxation and Pricing Strategies for the Vehicle Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the black and white traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition Principle for Linear Programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Column Generation / 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: An exact algorithm for the elementary shortest path problem with resource constraints: Application to some vehicle routing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Black and White Traveling Salesman Problem / 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: The traveling salesman problem and its variations. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Path Problems with Resource Constraints / 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: Selected Topics in Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Four-Day Aircraft Maintenance Routing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Implementing Mixed Integer Column Generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for designing rings for survivable fiber networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:50, 12 July 2024

scientific article
Language Label Description Also known as
English
A new formulation and approach for the black and white traveling salesman problem
scientific article

    Statements

    A new formulation and approach for the black and white traveling salesman problem (English)
    0 references
    0 references
    10 November 2016
    0 references
    traveling salesman problem
    0 references
    column generation
    0 references
    branch-and-price
    0 references
    cutting planes
    0 references

    Identifiers