Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
DOI10.1016/J.TCS.2011.07.012zbMATH Open1230.90030OpenAlexW1980537145MaRDI QIDQ653316FDOQ653316
Authors: Sara Mattia, Flavia Bonomo, Gianpaolo Oriolo 
Publication date: 9 January 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.07.012
Recommendations
- What are the worst cases in constrained last-in-first-out pick-up and delivery problems?
- On the Complexity of the Multiple Stack TSP, kSTSP
- Exact algorithms for the double vehicle routing problem with multiple stacks
- Approximation of the double traveling salesman problem with multiple stacks
- A branch-and-bound algorithm for the double travelling salesman problem with two stacks
Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Coloring of graphs and hypergraphs (05C15) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- Transitive Orientation of Graphs and Identification of Permutation Graphs
- A Characterization of Comparability Graphs and of Interval Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of comparability graph recognition and coloring
- The mutual exclusion scheduling problem for permutation and comparability graphs.
- A note on the decomposition of graphs into isomorphic matchings
- Equitable Coloring
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- An existential problem of a weight-controlled subset and its application to school timetable construction
- Mutual exclusion scheduling
- An exact method for the double TSP with multiple stacks
- Exact solutions to the double travelling salesman problem with multiple stacks
- The double traveling salesman problem with multiple stacks: A variable neighborhood search approach
- New neighborhood structures for the double traveling salesman problem with multiple stacks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Equitable colorings of bounded treewidth graphs
- Chromatic optimisation: Limitations, objectives, uses, references
- NP-completeness of graph decomposition problems
- The stable set problem and the thinness of a graph
- The χt-coloring problem
- Title not available (Why is that?)
- Bounded vertex coloring of trees
- Restrictions of graph partition problems. I
- Bounded vertex colorings of graphs
Cited In (16)
- On the thinness of trees
- Approximation of the double traveling salesman problem with multiple stacks
- Thinness of product graphs
- On \(H\)-topological intersection graphs
- The bounded beam search algorithm for the block relocation problem
- Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs
- Solving problems on generalized convex graphs via mim-width
- On the thinness and proper thinness of a graph
- Weighted and locally bounded list-colorings in split graphs, cographs, and partial \(k\)-trees
- What are the worst cases in constrained last-in-first-out pick-up and delivery problems?
- Exact algorithms for the double vehicle routing problem with multiple stacks
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach
- Polyhedral results and a branch-and-cut algorithm for the double traveling salesman problem with multiple stacks
- A branch-and-cut algorithm for the restricted block relocation problem
- Thinness and its variations on some graph families and coloring graphs of bounded thinness
- Precedence thinness in graphs
This page was built for publication: Bounded coloring of co-comparability graphs and the pickup and delivery tour combination problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q653316)
