Clique partitioning of interval graphs with submodular costs on the cliques
RAIRO-Oper. Res., 41 3 (2007) 275-287
Published online: 2007-08-21
Articles citing this article
The Citing articles tool gives a list of articles citing the current article.
The citing articles come from EDP Sciences database, as well as other publishers participating in CrossRef Cited-by Linking Program. You can set up your personal account to receive an email alert each time this article is cited by a new article (see the menu on the right-hand side of the abstract page).
Cited article:
This article has been cited by the following article(s):
Optimal autonomous truck platooning with detours, nonlinear costs, and a platoon size constraint
Qiaolin Hu, Weihua Gu, Lingxiao Wu and Le ZhangTransportation Research Part E: Logistics and Transportation Review 186 103545 (2024)
https://doi.org/10.1016/j.tre.2024.103545
Interval scheduling with economies of scale
Christopher Muir and Alejandro TorielloComputers & Operations Research 150 106056 (2023)
https://doi.org/10.1016/j.cor.2022.106056
On the Clique Partitioning of a Graph
M. Sh. LevinJournal of Communications Technology and Electronics 67 (S2) S267 (2022)
https://doi.org/10.1134/S1064226922140042
Covering and packing of triangles intersecting a straight line
Supantha PanditDiscrete Applied Mathematics 319 92 (2022)
https://doi.org/10.1016/j.dam.2021.11.017
A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs
Luciano Porretta, Daniele Catanzaro, Bjarni V. Halldórsson and Bernard Fortz4OR 17 (1) 75 (2019)
https://doi.org/10.1007/s10288-018-0377-3
The identical-path truck platooning problem
Nils Boysen, Dirk Briskorn and Stefan SchwerdfegerTransportation Research Part B: Methodological 109 26 (2018)
https://doi.org/10.1016/j.trb.2018.01.006
The Impact of Stealthy Attacks on Smart Grid Performance: Tradeoffs and Implications
Yara Abdallah, Zizhan Zheng, Ness B. Shroff, Hesham El Gamal and Tarek M. El-FoulyIEEE Transactions on Control of Network Systems 4 (4) 886 (2017)
https://doi.org/10.1109/TCNS.2016.2615158
Max point-tolerance graphs
Daniele Catanzaro, Steven Chaplick, Stefan Felsner, et al.Discrete Applied Mathematics 216 84 (2017)
https://doi.org/10.1016/j.dam.2015.08.019
Capacitated Max-Batching with interval graph compatibilities
Tim NonnerTheoretical Computer Science 613 79 (2016)
https://doi.org/10.1016/j.tcs.2015.10.047
Clique partitioning with value-monotone submodular cost
José R. Correa and Nicole MegowDiscrete Optimization 15 26 (2015)
https://doi.org/10.1016/j.disopt.2014.11.001
An Integer Programming Formulation of the Parsimonious Loss of Heterozygosity Problem
Daniele Catanzaro, Martine Labbe and Bjarni V. HalldorssonIEEE/ACM Transactions on Computational Biology and Bioinformatics 10 (6) 1391 (2013)
https://doi.org/10.1109/TCBB.2012.138
A Weakly Robust PTAS for Minimum Clique Partition in Unit Disk Graphs
Imran A. Pirwani and Mohammad R. SalavatipourAlgorithmica 62 (3-4) 1050 (2012)
https://doi.org/10.1007/s00453-011-9503-8
Minimum Entropy Combinatorial Optimization Problems
Jean Cardinal, Samuel Fiorini and Gwenaël JoretTheory of Computing Systems 51 (1) 4 (2012)
https://doi.org/10.1007/s00224-011-9371-2
4707 (2012)
https://doi.org/10.1109/GLOCOM.2012.6503862
1954 (2012)
https://doi.org/10.1109/CDC.2012.6425909
Bioinformatics Research and Applications
Daniele Catanzaro, Martine Labbé and Bjarni V. HalldórssonLecture Notes in Computer Science, Bioinformatics Research and Applications 7292 24 (2012)
https://doi.org/10.1007/978-3-642-30191-9_3
Minimizing total busy time in parallel scheduling with application to optical networks
Michele Flammini, Gianpiero Monaco, Luca Moscardelli, et al.Theoretical Computer Science 411 (40-42) 3553 (2010)
https://doi.org/10.1016/j.tcs.2010.05.011
Algorithm Theory - SWAT 2010
Tim NonnerLecture Notes in Computer Science, Algorithm Theory - SWAT 2010 6139 176 (2010)
https://doi.org/10.1007/978-3-642-13731-0_18
Mathematical Theory and Computational Practice
Jean Cardinal, Samuel Fiorini and Gwenaël JoretLecture Notes in Computer Science, Mathematical Theory and Computational Practice 5635 79 (2009)
https://doi.org/10.1007/978-3-642-03073-4_9
APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
TIM NONNER and ALEXANDER SOUZADiscrete Mathematics, Algorithms and Applications 01 (02) 153 (2009)
https://doi.org/10.1142/S1793830909000130
Algorithmic Aspects in Information and Management
Tim Nonner and Alexander SouzaLecture Notes in Computer Science, Algorithmic Aspects in Information and Management 5564 279 (2009)
https://doi.org/10.1007/978-3-642-02158-9_24
1 (2009)
https://doi.org/10.1109/IPDPS.2009.5161017
FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science
Takuro Fukunaga, Magnús M. Halldórsson and Hiroshi NagamochiLecture Notes in Computer Science, FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science 4855 84 (2007)
https://doi.org/10.1007/978-3-540-77050-3_7