Shortest paths with exclusive-disjunction arc pairs conflicts (Q6164356): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Shortest paths avoiding forbidden subpaths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colorful paths in vertex coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the path avoiding forbidden pairs polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A two-level metaheuristic for the all colors shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction heuristic for the all-colors shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tropical paths in vertex-colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest path tour problem with time windows / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient exact approach for the constrained shortest path tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The constrained shortest path tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the shortest path tour problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: L’algebre de Boole et ses applications en recherche operationnelle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical and computational study of several linearisation techniques for binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Linear Integer Programming Formulations of Nonlinear Integer Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Technical Note—Converting the 0-1 Polynomial Programming Problem to a 0-1 Linear Program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5538300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms – ESA 2005 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of paths avoiding forbidden pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of the path avoiding forbidden pairs problem revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compact linearization for binary quadratic problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Renormalization group analysis of the small-world network model / rank
 
Normal rank
Property / cites work
 
Property / cites work: On finding the strongly connected components in a directed graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved linearization strategy for zero-one quadratic programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Impossible pair constrained test path generation in a program / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer programming formulations for the elementary shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank

Latest revision as of 15:03, 1 August 2024

scientific article; zbMATH DE number 7706563
Language Label Description Also known as
English
Shortest paths with exclusive-disjunction arc pairs conflicts
scientific article; zbMATH DE number 7706563

    Statements

    Shortest paths with exclusive-disjunction arc pairs conflicts (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    4 July 2023
    0 references
    0 references
    shortest path
    0 references
    arc conflicts
    0 references
    matheuristics
    0 references
    web applications
    0 references
    0 references
    0 references