The family traveling salesman problem with incompatibility constraints (Q6065853): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(3 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1002/net.22036 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1002/net.22036 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3142352709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3425132 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the family traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic approaches for the family traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on optimization metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed profitable rural postman problem with incompatibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An ILS heuristic for the ship scheduling problem: application in the oil industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of a Large-Scale Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pickup and delivery problem with incompatibility constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient ant colony optimization algorithm for the blocks relocation problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5187226 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4452900 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomized heuristics for the family traveling salesperson problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5563210 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1002/NET.22036 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 19:07, 30 December 2024

scientific article; zbMATH DE number 7775498
Language Label Description Also known as
English
The family traveling salesman problem with incompatibility constraints
scientific article; zbMATH DE number 7775498

    Statements

    The family traveling salesman problem with incompatibility constraints (English)
    0 references
    0 references
    0 references
    0 references
    11 December 2023
    0 references
    ant colony optimization algorithm
    0 references
    branch-and-cut algorithm
    0 references
    family traveling salesman problem
    0 references
    incompatibility constraints
    0 references
    iterated local search algorithm
    0 references
    network flows
    0 references
    valid inequalities
    0 references

    Identifiers