Container ship stowage problem complexity and connection to the coloring of circle graphs
type: Item
instance of: scholarly article
title: Container ship stowage problem complexity and connection to the coloring of circle graphs
zbMATH Open document ID: 0962.90049
DOI: 10.1016/S0166-218X(99)00245-0
author: Mordecai Avriel
author: Michal Penn
author: Naomi Shpirer
published in: Discrete Applied Mathematics
publication date: 2000-07-11T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1474740
zbMATH Keywords: complexity
zbMATH Keywords: stowage plan for containers
zbMATH Keywords: container ship
zbMATH Keywords: shift problem
zbMATH Keywords: NP-complete
zbMATH Keywords: coloring of circle graphs
MaRDI profile type: Publication
cites work: Stowage planning for container ships to reduce the number of shifts
cites work: Scheduling trams in the morning
cites work: Reducing prime graphs and recognizing circle graphs
cites work: Circle graph obstructions
cites work: Q5422499
cites work: Q5684962
cites work: Algorithms for a maximum clique and a maximum independent set of a circle graph
cites work: The Complexity of Coloring Circular Arcs and Chords
cites work: Q3328583
cites work: Recognizing circle graphs in polynomial time
cites work: Finding maximum cliques in circle graphs
cites work: Recognition of Circle Graphs
cites work: The complexity of colouring circle graphs
full work available at URL: s0166-218x(99)00245-0
OpenAlex ID: W2074617595
description: scientific article; zbMATH DE number 1474740