Computing solutions of the paintshop-necklace problem
type: Item
instance of: scholarly article
title: Computing solutions of the paintshop-necklace problem
zbMATH Open document ID: 1251.90250
author: Frédéric Meunier
author: Bertrand Neveu
published in: Computers \& Operations Research
publication date: 2012-11-15T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6106621
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: integer programming
zbMATH Keywords: local search
zbMATH Keywords: paintshop problem
zbMATH Keywords: path-following method
zbMATH Keywords: splitting necklace
zbMATH Keywords: TFNP problem
describes a project that uses: INCOP
MaRDI profile type: Publication
full work available at URL: j.cor.2012.01.014
OpenAlex ID: W2066018442
cites work: Splitting necklaces
cites work: Q4011245
cites work: Algorithmic construction of sets for k -restrictions
cites work: The Borsuk-Ulam Theorem and Bisection of Necklaces
cites work: Greedy colorings for the binary paintshop problem
cites work: Some heuristics for the binary paint shop problem and their expected number of colour changes
cites work: Homotopy theory of graphs
cites work: Complexity results on restricted instances of a paint shop problem for words
cites work: The Borsuk--Ulam-property, Tucker-property and constructive proofs in combinatorics
cites work: Complexity results on a paint shop problem.
cites work: Combinatorial properties of certain simplicial and cubical vertex maps
cites work: Bisection of Circle Colorings
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
cites work: Discrete Splittings of the Necklace
cites work: Paintshop, odd cycles and necklace splitting
cites work: Q5687199
cites work: Principles and Practice of Constraint Programming – CP 2004
cites work: On the complexity of the parity argument and other inefficient proofs of existence
cites work: Q3524711
cites work: The Approximation of Fixed Points of a Continuous Mapping
cites work: Necklace bisection with one cut less than needed
DOI: 10.1016/J.COR.2012.01.014
description: scientific article; zbMATH DE number 6106621