Computing solutions of the paintshop-necklace problem (Q1761213): 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 / describes a project that uses
 
Property / describes a project that uses: INCOP / 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.2012.01.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2066018442 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Splitting necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4011245 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic construction of sets for <i>k</i> -restrictions / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borsuk-Ulam Theorem and Bisection of Necklaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy colorings for the binary paintshop problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some heuristics for the binary paint shop problem and their expected number of colour changes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Homotopy theory of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results on restricted instances of a paint shop problem for words / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity results on a paint shop problem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial properties of certain simplicial and cubical vertex maps / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bisection of Circle Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using the Borsuk-Ulam theorem. Lectures on topological methods in combinatorics and geometry. Written in cooperation with Anders Björner and Günter M. Ziegler / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete Splittings of the Necklace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paintshop, odd cycles and necklace splitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5687199 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Principles and Practice of Constraint Programming – CP 2004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of the parity argument and other inefficient proofs of existence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3524711 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Approximation of Fixed Points of a Continuous Mapping / rank
 
Normal rank
Property / cites work
 
Property / cites work: Necklace bisection with one cut less than needed / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:47, 5 July 2024

scientific article
Language Label Description Also known as
English
Computing solutions of the paintshop-necklace problem
scientific article

    Statements

    Computing solutions of the paintshop-necklace problem (English)
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    combinatorial optimization
    0 references
    integer programming
    0 references
    local search
    0 references
    paintshop problem
    0 references
    path-following method
    0 references
    splitting necklace
    0 references
    TFNP problem
    0 references
    0 references