On some applications of the selective graph coloring problem
From MaRDI portal
Publication:2629634
DOI10.1016/j.ejor.2014.05.011zbMath1357.05041OpenAlexW1965655408MaRDI QIDQ2629634
Cerasela Tanasescu, Marc Demange, Bernard Ries, Tınaz Ekim
Publication date: 6 July 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://doc.rero.ch/record/328824/files/selectivecopy.pdf
Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Coloring of graphs and hypergraphs (05C15) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (18)
On the minimum and maximum selective graph coloring problems in some graph classes ⋮ New inequalities for network distance measures by using graph spectra ⋮ Inverse chromatic number problems in interval and permutation graphs ⋮ An exact algorithm for the partition coloring problem ⋮ A systematic study on meta-heuristic approaches for solving the graph coloring problem ⋮ Grouping products for the optimization of production processes: a case in the steel manufacturing industry ⋮ Total coloring and total matching: polyhedra and facets ⋮ Minimum gradation in greyscales of graphs ⋮ Integrated truck and workforce scheduling to accelerate the unloading of trucks ⋮ The complexity of subtree intersection representation of chordal graphs and linear time chordal graph generation ⋮ An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs ⋮ The generalized minimum branch vertices problem: properties and polyhedral analysis ⋮ The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances ⋮ Perfectness of clustered graphs ⋮ On conjectures of network distance measures by using graph spectra ⋮ A note on selective line-graphs and partition colorings ⋮ ON GRAPH FOLDING AND MOBILE RADIO FREQUENCY ASSIGNMENT ⋮ Contrast in greyscales of graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the minimum and maximum selective graph coloring problems in some graph classes
- Routing and wavelength assignment by partition colouring
- A graph coloring model for a feasibility problem in monthly crew scheduling with preferential bidding
- The graph coloring problem: A neuronal network approach
- A tutorial on the use of graph coloring for some problems in robotics
- Partial integration of frequency allocation within antenna positioning in GSM mobile networks
- A graph coloring approach to scheduling of multiprocessor tasks on dedicated machines with availability constraints
- Adaptive automated construction of hybrid heuristics for exam timetabling and graph colouring problems
- The double travelling salesman problem with multiple stacks - formulation and heuristic solution approaches
- Unit disk graphs
- Unit disk graph recognition is NP-hard
- On coloring unit disk graphs
- Perfectness of clustered graphs
- Algorithmic graph theory and perfect graphs
- Claw-free graphs. VII. Quasi-line graphs
- Optimal berth allocation and time-invariant quay crane assignment in container terminals
- A branch-and-price approach for the partition coloring problem
- On the complexity of the selective graph coloring problem in some special classes of graphs
- Operations research at container terminals: a literature update
- A branch-and-cut algorithm for partition coloring
- Selective Graph Coloring in Some Special Classes of Graphs
- The Complexity of Coloring Circular Arcs and Chords
- Frequency planning and ramifications of coloring
- On rectangle intersection and overlap graphs
- Algorithms for a maximum clique and a maximum independent set of a circle graph
- The complexity of path coloring and call scheduling
This page was built for publication: On some applications of the selective graph coloring problem
