A branch-and-cut algorithm for graph coloring
2006, Discrete Applied Mathematics 154 (5), 826-847, 2006Citas: 276
Agregar PDF Importar citas SCRAPME Plots Conexiones
Autor(es)
Isabel Méndez-Díaz and Paula Zabala
Abstract
In this paper a Branch-and-Cut algorithm, based on a formulation previously introduced by us, is proposed for the Graph Coloring Problem. Since colors are indistinguishable in graph coloring, there may typically exist many different symmetrical colorings associated with a same number of colors. If solutions to an integer programming model of the problem exhibit that property, the Branch-and-Cut method tends to behave poorly even for small size graph coloring instances. Our model avoids, to certain extent, that bottleneck. Computational experience indicates that the results we obtain improve, in most cases, on those given by the well-known exact solution graph coloring algorithm Dsatur.
Plot de citas
Citas
| # | Title | Year | Source | Authors | |
|---|---|---|---|---|---|
| 1 | Symmetry in integer linear programming | 2009 | 50 Years of Integer Programming 1958-2008: From the … | F Margot | |
| 2 | A survey on vertex coloring problems | 2010 | International transactions in operational … | E Malaguti, P Toth | |
| 3 | Handbook of approximation algorithms and metaheuristics | 2007 | NA | TF Gonzalez | |
| 4 | Solving graph coloring problem using divide and conquer-based turbulent particle swarm optimization | 2021 | Arabian Journal for Science and … | R Marappan, G Sethumadhavan | |
| 5 | Applying quantum algorithms to constraint satisfaction problems | 2019 | Quantum | E Campbell, A Khurana, A Montanaro | |
| 6 | An exact approach for the vertex coloring problem | 2011 | Discrete Optimization | E Malaguti, M Monaci, P Toth | |
| 7 | Orbital branching | 2011 | Mathematical Programming | J Ostrowski, J Linderoth, F Rossi, S Smriglio | |
| 8 | Solving the maximum clique and vertex coloring problems on very large sparse networks | 2015 | INFORMS Journal on … | A Verma, A Buchanan | |
| 9 | Solution to graph coloring using genetic and tabu search procedures | 2018 | Arabian Journal for Science and … | R Marappan, G Sethumadhavan | |
| 10 | A metaheuristic approach for the vertex coloring problem | 2008 | INFORMS Journal on … | E Malaguti, M Monaci, P Toth | |
| 11 | Maximum-weight stable sets and safe lower bounds for graph coloring | 2012 | Mathematical Programming Computation | S Held, W Cook, EC Sewell | |
| 12 | Packing and partitioning orbitopes | 2008 | Mathematical Programming | V Kaibel, M Pfetsch | |
| 13 | Macromodular computer systems | 1967 | Proceedings of the April 18-20, 1967, spring joint … | WA Clark | |
| 14 | Exact solution of graph coloring problems via constraint programming and column generation | 2012 | INFORMS Journal on Computing | S Gualandi, F Malucelli | |
| 15 | Optimal price zones of electricity markets: a mixed-integer multilevel model and global solution approaches | 2019 | … methods and software | V Grimm, T Kleinert, F Liers, M Schmidt | |
| 16 | Variable space search for graph coloring | 2008 | Discrete Applied Mathematics | A Hertz, M Plumettaz, N Zufferey | |
| 17 | Partition independent set and reduction-based approach for partition coloring problem | 2020 | IEEE Transactions on Cybernetics | E Zhu, F Jiang, C Liu, J Xu | |
| 18 | A new DSATUR-based algorithm for exact vertex coloring | 2012 | Computers & Operations Research | P San Segundo | |
| 19 | New evolutionary operators in coloring DIMACS challenge benchmark graphs | 2022 | International Journal of Information … | R Marappan, S Bhaskaran | |
| 20 | A supernodal formulation of vertex colouring with applications in course timetabling | 2010 | Annals of Operations … | EK Burke, J Mareček, AJ Parkes, H Rudová | |
| 21 | Recent Advances in Practical Data Reduction. | 2022 | Algorithms for Big … | FN Abu-Khzam, S Lamm, M Mnich, A Noe | |
| 22 | A branch-and-cut procedure for the udine course timetabling problem | 2012 | Annals of Operations … | EK Burke, J Mareček, AJ Parkes, H Rudová | |
| 23 | Dual inequalities for stabilized column generation revisited | 2016 | INFORMS Journal on Computing | T Gschwind, S Irnich | |
| 24 | Effective data reduction for the vertex clique cover problem | 2022 | 2022 Proceedings of the Symposium on Algorithm … | D Strash, L Thompson | |
| 25 | Graph coloring with decision diagrams | 2022 | Mathematical Programming | WJ van Hoeve | |
| 26 | Complexity analysis and stochastic convergence of some well-known evolutionary operators for solving graph coloring problem | 2020 | Mathematics | R Marappan, G Sethumadhavan | |
| 27 | New integer linear programming models for the vertex coloring problem | 2018 | LATIN 2018: Theoretical Informatics: 13th Latin … | A Jabrayilov, P Mutzel | |
| 28 | A new multi-objective evolutionary approach to graph coloring and channel allocation problems | 2021 | Journal of Applied … | S Balakrishnan, T Suresh | |
| 29 | A new genetic algorithm for graph coloring | 2013 | 2013 Fifth International … | R Marappan, G Sethumadhavan | |
| 30 | Exam timetabling with allowable conflicts within a time window | 2019 | Computers & Industrial … | O Abou Kasm, B Mohandes, A Diabat | |
| 31 | The Operator for the Chromatic Number of a Graph | 2008 | SIAM Journal on Optimization | N Gvozdenović, M Laurent | |
| 32 | Building Dashboards for Windows SharePoint Services 3.0 Using SharePoint Designer 2007 | 2010 | NA | R Mitchell | |
| 33 | Solving vertex coloring problems as maximum weight stable set problems | 2017 | Discrete Applied Mathematics | D Cornaz, F Furini, E Malaguti | |
| 34 | A branch-and-cut algorithm for the connected max-k-cut problem | 2024 | European Journal of … | P Healy, N Jozefowiez, P Laroche, F Marchetti | |
| 35 | A genetic algorithm for graph coloring using single parent conflict gene crossover and mutation with conflict gene removal procedure | 2013 | 2013 IEEE International … | G Sethumadhavan, R Marappan | |
| 36 | Minimum partition into plane subgraphs: The CG: SHOP Challenge 2022 | 2023 | ACM Journal of … | SP Fekete, P Keldenich, D Krupke | |
| 37 | Solving the pricing problem in a branch-and-price algorithm for graph coloring using zero-suppressed binary decision diagrams | 2016 | INFORMS Journal on … | DR Morrison, EC Sewell | |
| 38 | Fundamental domains for integer programs with symmetries | 2007 | International Conference on Combinatorial … | EJ Friedman | |
| 39 | A branch‐and‐cut algorithm for partition coloring | 2010 | … An International Journal | Y Frota, N Maculan, TF Noronha | |
| 40 | An exact algorithm with learning for the graph coloring problem | 2014 | Computers & operations research | Z Zhou, CM Li, C Huang, R Xu | |
| 41 | Coloring graphs by iterated local search traversing feasible and infeasible solutions | 2008 | Discrete Applied Mathematics | M Caramia, P Dell'Olmo | |
| 42 | Point feature label placement for multi-page maps on small-screen devices | 2021 | Computers & … | S Gedicke, A Jabrayilov, B Niedermann, P Mutzel | |
| 43 | Ising formulations of some graph-theoretic problems in psychological research: models and methods | 2021 | Journal of Mathematical … | M Brusco, CP Davis-Stober, D Steinley | |
| 44 | A tree based novel approach for graph coloring problem using maximal independent set | 2020 | Wireless Personal Communications | PC Sharma, NS Chaudhari | |
| 45 | Heuristic and exact algorithms for a min–max selective vehicle routing problem | 2011 | Computers & Operations … | CA Valle, LC Martinez, AS Da Cunha | |
| 46 | Total coloring and total matching: Polyhedra and facets | 2022 | European Journal of Operational Research | L Ferrarini, S Gualandi | |
| 47 | Dynamic spectrum management for cognitive radio: an overview | 2009 | Wireless Communications and … | F Khozeimeh, S Haykin | |
| 48 | The minimum quasi-clique partitioning problem: Complexity, formulations, and a computational study | 2022 | Information Sciences | RA Melo, CC Ribeiro, JA Riveaux | |
| 49 | An exact method for graph coloring | 2006 | Computers & operations research | C Lucet, F Mendes, A Moukrim | |
| 50 | Solving graph coloring problem using ant colony optimization, simulated annealing and quantum annealing—A comparative study | 2022 | Intelligence Enabled Research: DoSIER 2021 | A Kole, D De, AJ Pal | |
| 51 | Symmetry in integer programming | 2009 | NA | J Ostrowski | |
| 52 | From cliques to colorings and back again | 2022 | … Conference on Principles … | MJH Heule, A Karahalios | |
| 53 | Greedy algorithms for the minimum sum coloring problem | 2009 | Logistique et transports | Y Li, C Lucet, A Moukrim, K Sghiouer | |
| 54 | Tabu search with feasible and infeasible searches for equitable coloring | 2018 | Engineering Applications of Artificial Intelligence | W Wang, JK Hao, Q Wu | |
| 55 | An Improved DSATUR‐Based Branch‐and‐Bound Algorithm for the Vertex Coloring Problem | 2017 | Networks | F Furini, V Gabrel, IC Ternier | |
| 56 | Shadoks approach to minimum partition into plane subgraphs | 2022 | … Geometry (SoCG 2022 … | L Crombez, GD da Fonseca, Y Gerard | |
| 57 | Three algorithms for graph locally harmonious colouring | 2017 | Journal of Difference Equations and Applications | W Gao | |
| 58 | Mixed graph colouring for unit-time scheduling | 2017 | International Journal of … | A Kouider, H Ait Haddadène, S Ourari | |
| 59 | Hilbert's Nullstellensatz and an algorithm for proving combinatorial infeasibility | 2008 | Proceedings of the twenty … | JA De Loera, J Lee, PN Malkin | |
| 60 | A one-to-one correspondence between colorings and stable sets | 2008 | Operations Research Letters | D Cornaz, V Jost | |
| 61 | Discrete optimization methods to fit piecewise affine models to data points | 2016 | Computers & Operations Research | E Amaldi, S Coniglio, L Taccari | |
| 62 | Solution to graph coloring problem using divide and conquer based genetic method | 2016 | … International Conference on … | R Marappan, G Sethumadhavan | |
| 63 | Integer Programming Approach to Graph Colouring Problem and Its Implementation in GAMS | 2023 | WSEAS Transactions on Systems | M Šeda | |
| 64 | Conflict optimization for binary CSP applied to minimum partition into plane subgraphs and graph coloring | 2023 | ACM Journal of … | L Crombez, GD Da Fonseca, F Fontan | |
| 65 | A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives | 2014 | Discrete Applied … | L Bahiense, Y Frota, TF Noronha, CC Ribeiro | |
| 66 | Computing infeasibility certificates for combinatorial problems through Hilbert's Nullstellensatz | 2011 | Journal of Symbolic … | JA De Loera, J Lee, PN Malkin, S Margulies | |
| 67 | Lower bounds for the minimal sum coloring problem | 2010 | Electronic Notes in Discrete … | A Moukrim, K Sghiouer, C Lucet, Y Li | |
| 68 | On the routing of unmanned aerial vehicles (UAVs) in precision farming sampling missions | 2022 | Information and Communication … | G Dolias, L Benos, D Bochtis | |
| 69 | New approximation algorithms for solving graph coloring problem–An experimental approach | 2016 | Perspectives in Science | R Marappan, G Sethumadhavan, RK Srihari | |
| 70 | Recent advances in practical data reduction | 2020 | arXiv preprint arXiv … | F Abu-Khzam, S Lamm, M Mnich, A Noe | |
| 71 | Stochastic local search methods for highly constrained combinatorial optimisation problems | 2005 | NA | M Chiarandini | |
| 72 | Stochastic local search algorithms for the graph coloring problem | 2018 | Handbook of … | M Chiarandini, I Dumitrescu | |
| 73 | Orbital branching | 2007 | … Ithaca, NY, USA, June 25-27 … | J Ostrowski, J Linderoth, F Rossi, S Smriglio | |
| 74 | Solving the List Coloring Problem through a branch-and-price algorithm | 2024 | European Journal of Operational Research | M Lucci, G Nasini, D Severín | |
| 75 | Quantum inspired cuckoo search algorithm for graph colouring problem | 2015 | International Journal of Bio … | H Djelloul, A Layeb, S Chikhi | |
| 76 | An exact cutting plane algorithm to solve the selective graph coloring problem in perfect graphs | 2021 | European Journal of Operational Research | O Şeker, T Ekim, ZC Taşkın | |
| 77 | Binary bat algorithm for graph coloring problem | 2014 | 2014 Second World Conference … | H Djelloul, S Sabba, S Chikhi | |
| 78 | Locally orthogonal training design for cloud-RANs based on graph coloring | 2017 | IEEE Transactions on Wireless … | J Zhang, X Yuan, YJ Zhang | |
| 79 | A DSATUR-based algorithm for the equitable coloring problem | 2015 | Computers & Operations Research | I Méndez-Díaz, G Nasini, D Severín | |
| 80 | Quantum-inspired Formulations for the Max k-cut Problem | 2021 | … Report 21T-007 | R Fakhimi, H Validi, IV Hicks | |
| 81 | A fast greedy sequential heuristic for the vertex colouring problem based on bitwise operations | 2016 | Journal of Combinatorial … | L Komosko, M Batsyn, PS Segundo | |
| 82 | Safe lower bounds for graph coloring | 2011 | … Conference, IPCO 2011, New York, NY … | S Held, W Cook, EC Sewell | |
| 83 | Wave function collapse coloring: A new heuristic for fast vertex coloring | 2021 | arXiv preprint arXiv:2108.09329 | A Mac, D Perkins | |
| 84 | Matrix based graph coloring algorithm for LTE-PCI assignment and reassignment reduction | 2017 | 2017 IEEE 8th Control … | MM Abdulkareem, SA Yaseen | |
| 85 | Improving bounds on the football pool problem by integer programming and high-throughput computing | 2009 | INFORMS Journal on … | J Linderoth, F Margot, G Thain | |
| 86 | The vertex coloring problem and its generalizations | 2009 | 4OR | E Malaguti | |
| 87 | Computer algebra, combinatorics, and complexity: Hilbert's Nullstellensatz and NP-complete problems | 2008 | NA | S Margulies | |
| 88 | Exact methods for the minimum sum coloring problem | 2015 | NA | C Lecat, CM Li, C Lucet, Y Li | |
| 89 | Graph coloring: the more colors, the better? | 2010 | 2010 11th International Symposium on … | T Szép, ZÁ Mann | |
| 90 | Distributed data aggregation in multi-sink sensor networks using a graph coloring algorithm | 2008 | 22nd International Conference on … | R Kawano, T Miyazaki | |
| 91 | An integer programming approach to b-coloring | 2019 | Discrete Optimization | I Koch, J Marenco | |
| 92 | Fast heuristics for the frequency channel assignment problem in multi-hop wireless networks | 2016 | European Journal of Operational … | AU Chaudhry, JW Chinneck, RHM Hafez | |
| 93 | Computing semidefinite programming lower bounds for the (fractional) chromatic number via block-diagonalization | 2008 | SIAM Journal on Optimization | N Gvozdenović, M Laurent | |
| 94 | Clusterwise linear regression with the least sum of absolute deviations–an mip approach | 2012 | International Journal of Operations Research | Z Zhu, Y Li, N Kong | |
| 95 | Polyhedral Approach to Total Matching and Total Coloring Problems | 2023 | NA | L Ferrarini | |
| 96 | Optimal sorting of rolling stock | 2011 | NA | R Hansmann | |
| 97 | New methods for branch-and-bound algorithms | 2014 | NA | DR Morrison | |
| 98 | A wide branching strategy for the graph coloring problem | 2014 | INFORMS Journal … | DR Morrison, JJ Sauppe, EC Sewell | |
| 99 | Upper and lower bounds for the minimum sum coloring problem | 2014 | submitted for publication | A Moukrim, K Sghiouer, C Lucet, Y Li | |
| 100 | Valid Inequalities and Branch-and-Cut Algorithm for the Constrained-Routing and Spectrum Assignment Problem | 2021 | NA | I Diarrassouba, Y Hadhbi, AR Mahjoub | |
| 101 | A column generation based algorithm for the robust graph coloring problem | 2017 | Discrete Applied Mathematics | B Yüceoğlu, G Şahin, SPM van Hoesel | |
| 102 | A new heuristic for finding verifiable k-vertex-critical subgraphs | 2022 | Journal of Heuristics | A Gliesch, M Ritt | |
| 103 | Automatically generated algorithms for the vertex coloring problem | 2013 | PLoS One | C Contreras Bolton, G Gatica, V Parada | |
| 104 | Strengthened Partial-Ordering Based ILP Models for the Vertex Coloring Problem | 2022 | arXiv preprint arXiv:2206.13678 | A Jabrayilov, P Mutzel | |
| 105 | A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems | 2010 | Electronic Notes in Discrete Mathematics | M Campêlo, RC Corrêa | |
| 106 | Embedding a novel objective function in a two-phased local search for robust vertex coloring | 2008 | European Journal of Operational Research | M Caramia, P Dell'Olmo | |
| 107 | Bounding vertex coloring by truncated multistage branch and bound | 2004 | Networks: An International Journal | M Caramia, P Dell'Olmo | |
| 108 | Graph Coloring on Bipartite Graphs | 2022 | International Journal of Mathematical … | B Sennaiyan, T Suresh | |
| 109 | A list based approach to solve graph coloring problem | 2018 | … on System Modeling & Advancement in … | AN Shukl, ML Garg | |
| 110 | A segment-graph algorithm for two-objective wireless spectrum allocation in cognitive networks | 2021 | Computer Communications | J Gao, C Guo, M Pu, X Zhang, Y Li, J Wu | |
| 111 | A branch-and-cut algorithm to solve the container storage problem | 2014 | Proceedings of the ninth … | NF Ndiaye, ADI Yassine | |
| 112 | Scheduling with conflicts: formulations, valid inequalities, and computational experiments | 2023 | arXiv preprint arXiv:2312.14777 | PFS Moura, R Leus, H Yaman | |
| 113 | Approximating the stability number and the chromatic number of a graph via semidefinite programming | 2008 | NA | N Gvozdenovic | |
| 114 | An approach to solve graph coloring problem using linked list | 2019 | International Journal of Advanced … | AN Shukla, ML Garg, R Misra | |
| 115 | Solving the bandwidth coloring problem applying constraint and integer programming techniques | 2016 | Optimization Online (e … | B Dias, R de Freitas, N Maculan | |
| 116 | Branch-Cut-and-Propagate for the Maximum k-Colorable Subgraph Problem with Symmetry | 2011 | Integration of AI and OR Techniques in … | T Januschowski, ME Pfetsch | |
| 117 | Distributed and dynamic TDMA channel scheduling algorithm for WIA-PA | 2009 | 2009 IEEE International … | X Zhang, W Liang, M Zheng | |
| 118 | Heuristic algorithms for graph coloring problems | 2018 | NA | W Sun | |
| 119 | Sum coloring: New upper bounds for the chromatic strength | 2016 | arXiv preprint arXiv:1609.02726 | C Lecat, C Lucet, CM Li | |
| 120 | A branch and cut approach to linear programs with linear complementarity constraints | 2011 | NA | B Yu | |
| 121 | Solving a multicoloring problem with overlaps using integer programming | 2010 | Discrete Applied Mathematics | I Méndez-Díaz, P Zabala | |
| 122 | Cutting-plane-based algorithms for two branch vertices related spanning tree problems | 2014 | Optimization and Engineering | A Rossi, A Singh, S Sundar | |
| 123 | A note on computational approaches for the antibandwidth problem | 2021 | Central European Journal of Operations Research | M Sinnl | |
| 124 | A binary cuckoo search algorithm for graph coloring problem | 2014 | International Journal of Applied … | H Djelloul, A Layeb, S Chikhi | |
| 125 | Fractional programming formulation for the vertex coloring problem | 2014 | Information Processing Letters | T Matsui, N Sukegawa, A Miyauchi | |
| 126 | A Linked List-Based Exact Algorithm for Graph Coloring Problem. | 2019 | Revue d'Intelligence … | AN Shukla, V Bharti, ML Garag | |
| 127 | Polyhedral studies of vertex coloring problems: The standard formulation | 2016 | Discrete Optimization | D Delle Donne, J Marenco | |
| 128 | Branch-and-cut algorithms for graph problems | 2015 | NA | B Yüceoglu | |
| 129 | Distributed coloring algorithm for wireless sensor networks and its applications | 2007 | 7th IEEE International Conference on … | R Kawano, T Miyazaki | |
| 130 | Local Search for the Colouring Graph Problem. A Computational Study. | 2003 | TU Darmstadt, FB Intellektik … | M Chiarandini, I Dumitrescu, T Stützle | |
| 131 | Handling sub-symmetries in integer linear programming using activation handlers | 2022 | NA | S Wessel, T Verhoeff, CAJ Hurkens | |
| 132 | Greedy graph coloring algorithm based on depth first search | 2020 | International Journal on Emerging … | S Gupta, DP Singh | |
| 133 | A Diversity Algorithm of Nested Rollout Policy Adaptation for Graph Coloring. | 2023 | IAENG International Journal of Computer Science | W Yang, J Li, L Wang | |
| 134 | Polyhedral studies of vertex coloring problems: The asymmetric representatives formulation | 2015 | arXiv preprint arXiv … | V Campos, RC Corrêa, DD Donne, J Marenco | |
| 135 | A constructive matheuristic approach for the vertex colouring problem | 2022 | NA | RC Chandrasekharan, T Wauters | |
| 136 | A branch-price-and-cut algorithm for graph coloring | 2021 | NA | RP Hulst | |
| 137 | Koala graph coloring library: An open graph coloring library for real-world applications | 2008 | 2008 1st International … | T Dobrowolski, D Dereniowski | |
| 138 | An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools | 2017 | Annals of Operations … | F Bonomo, J Catalán, G Durán, R Epstein | |
| 139 | Spectrum Requirements for Interference-Free Wireless Mesh Networks | 2015 | NA | AU Chaudhry | |
| 140 | Advances in Discrete Optimization: From Truss Design Optimization to Quantum Computing Optimization | 2024 | NA | R Fakhimi | |
| 141 | Radio Resource Management in 5G networks | 2020 | 2020 International … | A Chernov, V Matyukhin, M Somov | |
| 142 | Two-stage stochastic programming for adaptive interdiscipinary pain management | 2015 | NA | N Wang | |
| 143 | Combining lithography and Directed Self Assembly for the manufacturing of vias: Connections to graph coloring problems, Integer Programming formulations, and … | 2020 | European Journal of … | D Ait-Ferhat, V Juliard, G Stauffer, JA Torres | |
| 144 | Structural effects in algorithm performance: A framework and a case study on graph coloring | 2017 | 2017 Computing … | TT Lopez, E Schaeffer | |
| 145 | Algorithmes pour des problèmes de bin packing mono-et multi-objectif | 2010 | NA | A Khanafer | |
| 146 | The minimum chromatic violation problem: a polyhedral study | 2017 | Electronic Notes in … | M Braga, D Delle Donne, M Escalante | |
| 147 | On the Facial Structure of the Constrained-Routing and Spectrum Assignment Polyhedron: Part II | 2021 | NA | I Diarrassouba, Y Hadhbi, AR Mahjoub | |
| 148 | Symmetry Handling in Mixed‐Integer Programming | 2010 | Wiley Encyclopedia of Operations Research and … | J Ostrowski | |
| 149 | The maximum‐impact coloring polytope | 2017 | International … | M Braga, D Delle Donne, R Linfati | |
| 150 | Integer and constraint programming approaches for providing optimality to the bandwidth multicoloring problem | 2021 | RAIRO-Operations … | B Dias, R de Freitas, N Maculan | |
| 151 | A branch‐and‐price algorithm for the (k,c)‐coloring problem | 2015 | … | E Malaguti, I Méndez‐Díaz, J José Miranda‐Bront | |
| 152 | Exploiting Symmetry in Linear and Integer Linear Programming | 2023 | NA | EJ Deakins | |
| 153 | On semidefinite lift-and-project of combinatorial optimization problems | 2023 | NA | F Battista | |
| 154 | The Constrained-Routing and Spectrum Assignment Problem: Polyhedral Analysis and Algorithms | 2022 | NA | Y Hadhbi | |
| 155 | Cseggraph: a graph colouring instance generator | 2009 | International Journal of Computer Mathematics | S Hossain | |
| 156 | Implementing cutting planes for the chromatic violation problem | 2021 | Proceedings of the Joint … | D Delle Donne, M Escalante | |
| 157 | Estudios poliedrales de problemas de coloreo de grafos | 2016 | NA | DA Delle Donne | |
| 158 | Combining bat algorithm with angle modulation for graph coloring problem | 2015 | Proceedings of the Symposium on Complex … | H Djelloul, S Chikhi | |
| 159 | MAXIMAL CLIQUE AND GRAPH COLORING HEURISTICS FOR OVERLAPPING COMMUNITY DETECTION IN NETWORK PSYCHOMETRICS | 2020 | NA | M Brusco, D Steinley, AL Watts | |
| 160 | Solving the pricing problem in a generic branch-and-price algorithm using zero-suppressed binary decision diagrams | 2014 | arXiv preprint arXiv … | DR Morrison, EC Sewell | |
| 161 | On the structure of Gröbner bases for graph coloring ideals | 2014 | NA | M Pernpeintner | |
| 162 | Scheduling algorithm to select optimal programme slots in television channels: A graph theoretic approach | 2017 | International Journal of Applied and Computational … | M Pal, A Pal | |
| 163 | Logic programming with max-clique and its application to graph coloring (tool description) | 2018 | … Communications of the … | M Codish, M Frank, A Metodi | |
| 164 | A Modified Cultural-Based Genetic Algorithm for the Graph Coloring Problem | 2022 | Distributed Sensing and … | MA Basmassi, L Benameur, JA Chentoufi | |
| 165 | The Distance Polytope for the Vertex Coloring Problem | 2018 | … 5th International Symposium … | B Dias, R de Freitas, N Maculan, J Marenco | |
| 166 | Etudes en recherche locale adaptative pour l'optimisation combinatoire | 2007 | Mémoire de thèse de Doctorat en … | I Devarenne | |
| 167 | Heuristics for the Generalized Graph Coloring Problem | 2021 | 2021 12th International Conference on … | AS Kare, V Kumar | |
| 168 | Algorithm selection for the graph coloring problem | 2012 | NA | M Schwengerer | |
| 169 | Gravitational Swarm for Graph Coloring | 2012 | The University of the Basque Country | ICR Ruiz | |
| 170 | Pre-processing and linear-decomposition algorithm to solve the k-colorability problem | 2004 | International Workshop on Experimental … | C Lucet, F Mendes, A Moukrim | |
| 171 | An optimal algorithm to find a maximum weight 2-coloured set on cactus graphs | 2010 | Journal of Information and Computing Science | K Das, M Pal | |
| 172 | The max-cut problem on classical and quantum solvers | 2021 | NA | R FAKHIMI, H VALIDI, IV HICKS, T TERLAKY | |
| 173 | Efficient resource allocation for IEEE 802.15. 3 (a) ad hoc networks | 2004 | International Conference on … | YH Tseng, HK Wu, KL Shieh, GH Chen | |
| 174 | A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem | 2011 | Discrete Optimization | D Delle Donne, J Marenco | |
| 175 | Radial Basis Function Neural Network System Identification and Model Prediction Control for Aircraft | 2021 | NA | GD Smith | |
| 176 | Integer Programming Techniques for Propagation and Rainbow Connection Problems in Graphs | 2021 | NA | LA Smith | |
| 177 | Graph coloring in sparse derivative matrix computation | 2005 | NA | M Goyal | |
| 178 | A hybrid cultural-hierarchical clustering algorithm for the graph coloring problem | 2019 | Journal of Advanced … | MA Basmassi, L Benameur | |
| 179 | The minimum chromatic violation problem: A polyhedral approach | 2020 | Discrete Applied … | M Braga, D Delle Donne, MS Escalante | |
| 180 | Comparaison de méthodes de résolution pour le probleme de somme coloration | 2015 | JFPC-2015 | C Lecat, CM Li, C Lucet, Y Li | |
| 181 | Ordered cover-free families in graph coloring | 2021 | NA | A Karkinen | |
| 182 | The RSI Allocation Problem: exact and heuristic methods | 2021 | NA | MA Londe, RJRJ Gávea | |
| 183 | Optimization methods for piecewise affine model fitting | 2009 | NA | L Taccari | |
| 184 | Almost Symmetries and the Unit Commitment Problem | 2017 | NA | BA Knueven | |
| 185 | Study of algorithm for coloring in various graph | 2022 | NA | A Malviya, B Agrawal, SKA Mansuri | |
| 186 | Approximating the chromatic number of a graph by semidefinite programming | 2005 | preprint | N Gvozdenovic, M Laurent | |
| 187 | Facets of the minimum-adjacency vertex coloring polytope | 2010 | NA | D Delle Donne, J Marenco | |
| 188 | A polyhedral study of the acyclic coloring problem | 2012 | Discrete Applied Mathematics | M Braga, D Delle Donne, J Marenco | |
| 189 | Finding Locally Unique IDs in Enormous IoT systems | 2022 | NA | S Yngman | |
| 190 | Optimised grid-partitioning for block structured grids in parallel computing | 2007 | NA | D Junglas | |
| 191 | Tabu-NG: hybridation de programmation par contraintes et recherche locale pour la résolution de CSP | 2010 | NA | M Dib | |
| 192 | Structure-Driven Randomized Particle Swarm Optimization | NA | NA | JC Aguilar Canepa | |
| 193 | A polyhedral study of the acyclic coloring problem | 2009 | Electronic Notes in Discrete Mathematics | M Braga, J Marenco | |
| 194 | Facets based on cycles and cliques for the acyclic coloring polytope | 2020 | RAIRO-Operations Research | M Braga, J Marenco | |
| 195 | A polyhedral investigation of star colorings | 2016 | Discrete Applied Mathematics | C Hojny, ME Pfetsch | |
| 196 | Planning the workday of bus drivers by a graph list-coloring model | 2018 | Electronic Journal of SADIO | M Lucci, G Nasini, D Severín | |
| 197 | Symmetry in the graph coloring problem | NA | NA | PA Roefs | |
| 198 | Otimização de parâmetros do núcleo do reator IEA-R1 utilizando o algoritmo de enxame de partículas | 2024 | NA | TA Santos | |
| 199 | TOTAL VIEWS: 5582 | NA | NA | S Balakrishnan, T Suresh, R Marappan | |
| 200 | A Parallel Algorithm for Coloring the Vertices of a Graph | 2020 | NA | AS NARVIK | |
| 201 | Two lagrangian relaxation based heuristics for vertex coloring problem | 2020 | Cumhuriyet Science Journal | Aİ MAHMUTOĞULLARI | |
| 202 | TOTAL VIEWS | NA | NA | S Balakrishnan, T Suresh, R Marappan | |
| 203 | TOTAL VIEWS: 5616 | NA | NA | S Balakrishnan, T Suresh, R Marappan | |
| 204 | A DSATUR-based algorithm for the Equitable Coloring Problem 6 | NA | NA | I Méndez-Dıaza, G Nasinib, D Severınb | |
| 205 | Graph theory package for giac/Xcas | 2022 | NA | L Marohni | |
| 206 | Optimisation et validation de la charge utile d'un satellite de télécommunication | 2013 | NA | FC Bessaih | |
| 207 | 基于图着色理论的多飞艇多载荷协同对地观测和数据传输调度模型与算法 | NA | NA | 周光辉， 敬帅， 梁伟 | |
| 208 | An Approach for Solving the Graph Coloring Problem using Adjacency Matrix | 2019 | 2019 8th International Conference System … | C Negi, AN Shukla | |
| 209 | Scalable Channel Estimation | 2019 | … Signal Processing in … | YJA Zhang, C Fan, X Yuan, YJA Zhang, C Fan | |
| 210 | Scalable Signal Processing in Cloud Radio Access Networks | 2019 | NA | YJA Zhang, C Fan, X Yuan | |
| 211 | A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem | NA | NA | DDDJ Marenco | |
| 212 | New facets and facet-generating procedures for the orientation model for vertex coloring problems | NA | NA | D Delle Donne, J Marencoa | |
| 213 | DSA-aware multiple patterning for the manufacturing of vias: Connections to graph coloring problems, IP formulations, and numerical experiments | 2019 | arXiv preprint arXiv … | D Ait-Ferhat, V Juliard, G Stauffer, JA Torres | |
| 214 | Contemporary Methods for Graph Coloring as an Example of Discrete Optimization | 2019 | International Journal of Electronics and … | A Bilski | |
| 215 | Algoritmos exatos para o problema de coloração de grafos | 2018 | NA | FLB Martins | |
| 216 | Computational Design and Experimental Validation of Functional Ribonucleic Acid Nanostructures | 2018 | NA | K Zandi | |
| 217 | A decomposition approach to solve the selective graph coloring problem | 2018 | NA | O Şeker | |
| 218 | Convex and online optimization: Applications to scheduling and selection problems | 2018 | NA | VI Verdugo Silva | |
| 219 | Politopo baseado em distâncias para o problema clássico de coloração de vértices em grafos | 2018 | Anais do III Encontro de … | B Dias, R de Freitas, J Marenco | |
| 220 | Exact algorithms for the Vertex Coloring Problem and its generalisations | 2017 | NA | IC Ternier | |
| 221 | PROBLEMAS DE OTIMIZAÇÃO EM QUASE-CLIQUES | NA | NA | JAR MERINO | |
| 222 | Algorithms on Graph Coloring Problem | 2020 | Journal of Physics: Conference Series | M Yang | |
| 223 | Combining Bat Algorithmwith angle modulation for Graph Coloring Problem | NA | NA | H Djelloul, S Chikhi | |
| 224 | An improved DSATUR-based Branch and Bound for the Vertex Coloring Problem | NA | NA | F Furini, V Gabrel, IC Ternier | |
| 225 | A Method of Generating Instances to Test the Heuristic Algorithms for Integer Problems | 2015 | ИНФОРМАЦИОННЫЕ ТЕХНОЛОГИИ | EY Orekhov | |
| 226 | Modelagem matemática e aplicações do problema de coloração em grafos | 2007 | NA | D Lozano | |
| 227 | Un algorithme constructif efficace pour le problème de coloration de graphe | 2013 | NA | MMA Adegbindin | |
| 228 | Популяционный алгоритм раскраски графа методом кристаллизации россыпи альтернатив | 2020 | Вестник Ростовского … | Б Лебедев, ОБ Лебедев, ЕО Лебедева | |
| 229 | LEVERAGING HPC POWER FOR SOLVING ABSTRACT MATHEMATICAL PROBLEMS | 2013 | NA | E TOTONI, A TAVAKKOL, KG BARADARAN | |
| 230 | Modelos matemáticos para o problema de empacotamento em faixas de peças irregulares | 2015 | NA | MO Rodrigues | |
| 231 | Statistical Heuristic Selection for Graph Coloring | 2012 | NA | AA Freer | |
| 232 | Étude et séparation des inégalités valides pour des problèmes de partitionnement et de couverture | 2013 | NA | M Groiez | |
| 233 | Binary Clustering Problems: Symmetric, Asymmetric and Decomposition Formulations R. Jans | 2010 | Les Cahiers du GERAD ISSN | J Desrosiers | |
| 234 | Barvení grafů pomocí mravenčí kolonie | 2010 | NA | M Vámošová | |
| 235 | A POLYHEDRAL APPROACH FOR THE GRAPH EQUITABLE COLORING PROBLEM | NA | NA | IM Diaza, G Nasinib, D Severınb | |
| 236 | A generalization of the graph multicoloring problem | NA | NA | I Méndez-Dıaz, P Zabala | |
| 237 | Graph Coloring via Constraint Programming-based Column Generation | NA | NA | SGF Malucelli | |
| 238 | A Branch-and-Cut Algorithm for Equitable Coloring | NA | NA | L Bahiense, Y Frota, N Maculan, TF Noronha | |
| 239 | Univerzitní rozvrhování pomocí celoˇcíselného programování | NA | NA | J Marecek | |
| 240 | Bas Schaafsma | 2009 | NA | H van Maaren, MJH Heule, C Witteveen, H Geers | |
| 241 | Scheduling research grant proposal evaluation meetings and the range colouring problem | 2007 | Practice and Theory of Automated Timetabling VI: 6th … | P Healy | |
| 242 | New Approximation Algorithms for Solving Graph | 2006 | Discrete Applied Mathematics | RMGS RK | |
| 243 | Algoritmos para o Problema de Coloração de Grafos | 2001 | Computational optimization and … | MF Rego, HG Santos | |
| 244 | Programación de recursos para reparación de componentes en un sistema de distribución de energía eléctrica usando control optimo | 2020 | NA | JA Villegas Flórez | |
| 245 | Colorações em grafos com restrições de distância: caracterizações, politopos e estratégias em programação matemática | 2019 | NA | BRC Dias | |
| 246 | Графический алгоритм решения задачи распределения ресурсов в сетях 5G | 2020 | Инжиниринг и … | АВ Чернов, ВВ Матюхин, М Сомов | |
| 247 | Coloration de graphes et ses applications aux problèmes d'ordonnancement | 2018 | NA | A Kouider | |
| 248 | Diseño de jornadas laborales de conductores y coloreo por listas en grafos | 2017 | … de Investigación Operativa (SIO)-JAIIO 46 … | M Lucci, G Nasini | |
| 249 | Convex and online optimization: applications to scheduling and selection problems | 2018 | NA | V Verdugo | |
| 250 | Clique als Optimierungsproblem | 2017 | NA | R Schrage | |
| 251 | FROTA, YURI ABITBOL DE MENEZES | NA | NA | C Janeiro, I COPPE, UII Tıtulo | |
| 252 | Coloreo de aristas propio con distinción de vértices adyacentes | 2016 | … (SIO 2016)-JAIIO 45 (Tres de … | B Curcio, I Méndez Díaz, P Zabala | |
| 253 | Эффективная pаскpаска гpафа с помощью битовых опеpаций | 2015 | МОДЕЛИPОВАНИЕ И ОПТИМИЗАЦИЯ MODELING … | МВ Бацын | |
| 254 | Université Abdelhamid Mehri | 2015 | NA | M BENSOUYAD | |
| 255 | Быстрый алгоритм для решения задачи о раскраске графа с использованием битовых операций | NA | NA | ЛФ Комоско, МВ Бацын | |
| 256 | Una Variación del Problema de Ordenamiento Lineal | 2013 | NA | B Curcio | |
| 257 | 布尔矩阵平方根问题及其与图着色问题的关系 | 2013 | 高校应用数学学报: A 辑 | 杨雁， 贾堰林， 王学平 | |
| 258 | Intensification/Diversification VNS Application au Probleme de Coloration de Graphe | 2011 | … de Programmation par Contraintes (JFPC'11) | S Loudni | |
| 259 | Tabu-NG: hybridation de programmation par contraintes et recherche locale pour la résolution de CSP | 2010 | NA | M VASQUEZ, T DEFAIX, DDG de l'Armement | |
| 260 | O método de geração de colunas aplicado a problemas de otimização em grafos | 2009 | NA | CC ele Souza | |
| 261 | Analysis of adaptive local search for the graph coloring problem | NA | NA | I Devarenne, A Caminada, H Mabed | |
| 262 | Formulations of the max k-cut problem on classical and quantum computers | NA | NA | R Fakhimi, H Validi, IV Hicks, T Terlaky, LF Zuluaga | |
| 263 | Local elimination algorithms for sparse discrete optimization problems | NA | NA | OA Shcherbina | |
| 264 | A Linked List-Based Exact Algorithm for Graph Coloring Problem A Linked List-Based Exact Algorithm for Graph Coloring Problem | NA | NA | AN Shukla, V Bharti, ML Garag | |
| 265 | A Novel Approach to Solve Graph Colouring Problem | NA | NA | AN Shukla, ML Garg | |
| 266 | Reformulations and Decompositions of Mixed Integer Linear and Nonlinear Programs | NA | NA | F Furini, R Mahjoub | |
| 267 | An exact algorithm with learning for the graph coloring problem 6 | NA | NA | Z Zhoua, CM Lia, C Huanga, R Xua | |
| 268 | A new DSATUR-based algorithm for the Equitable Coloring Problem | NA | NA | I Méndez-Dıaza, G Nasinib, D Severınb | |
| 269 | Méthodes de décomposition pour la coloration de graphes | 2005 | NA | F Mendès | |
| 270 | Variable Space Search for Graph Coloring A. Hertz, M. Plumettaz | NA | NA | N Zufferey | |
| 271 | Orbital Branching | NA | NA | F Rossi, S Smriglio | |
| 272 | Fundamental Domains for Combinatorial Integer Programs with Symmetries | NA | NA | EJ Friedman | |
| 273 | Ian-Christopher TERNIER | NA | NA | MRW CALVO, MI LJUBIC | |
| 274 | Solving dynamic graph coloring problem by using a heuristic algorithm | 2018 | NA | G Süngü | |
| 275 | Approches Métaheuristiques à base de Population pour la Coloration de Graphes | 2015 | NA | M BENSOUYAD | |
| 276 | Trabajo Práctico Investigación Operativa Segundo cuatrimestre 2010 | 2011 | NA | F Hernández |