


default search action
Francisco Barahona
2020 – today
- 2025
- [j55]Mourad Baïou, Francisco Barahona:
An algorithm for packing hypertrees. Discret. Math. 348(1): 114397 (2025) - [j54]Hassene Aissi, Mourad Baïou, Francisco Barahona:
New bounds for the number of lightest cycles in undirected graphs. Inf. Process. Lett. 189: 106555 (2025) - 2023
- [j53]Mourad Baïou, Francisco Barahona:
On some algorithmic aspects of hypergraphic matroids. Discret. Math. 346(2): 113222 (2023) - [c13]Radu Marinescu, Haifeng Qian
, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel:
Approximate Inference in Logical Credal Networks. IJCAI 2023: 5694-5701 - 2022
- [j52]Mourad Baïou, Francisco Barahona:
Network disconnection games: A game theoretic approach to checkpoint evaluation in networks. Discret. Appl. Math. 308: 198-208 (2022) - [c12]Mourad Baïou, Francisco Barahona:
Packing Hypertrees and the k-cut Problem in Hypergraphs. LION 2022: 521-534 - [c11]Radu Marinescu, Haifeng Qian, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel, Pravinda Sahu:
Logical Credal Networks. NeurIPS 2022 - [e1]Ivana Ljubic
, Francisco Barahona
, Santanu S. Dey
, Ali Ridha Mahjoub
:
Combinatorial Optimization - 7th International Symposium, ISCO 2022, Virtual Event, May 18-20, 2022, Revised Selected Papers. Lecture Notes in Computer Science 13526, Springer 2022, ISBN 978-3-031-18529-8 [contents] - 2021
- [j51]Rui Sa Shibasaki
, Mourad Baïou, Francisco Barahona, Philippe Mahey, Maurício C. de Souza
:
Lagrangian bounds for large-scale multicommodity network design: a comparison between Volume and Bundle methods. Int. Trans. Oper. Res. 28(1): 296-326 (2021) - [i2]Haifeng Qian, Radu Marinescu, Alexander G. Gray, Debarun Bhattacharjya, Francisco Barahona, Tian Gao, Ryan Riegel, Pravinda Sahu:
Logical Credal Networks. CoRR abs/2109.12240 (2021) - 2020
- [j50]Mourad Baïou, Francisco Barahona
:
Network strength games: the core and the nucleolus. Math. Program. 180(1): 117-136 (2020) - [c10]Mourad Baïou, Francisco Barahona:
On the p-Median Polytope and the Directed Odd Cycle Inequalities. ISCO 2020: 15-26 - [i1]Ryan Riegel, Alexander G. Gray, Francois P. S. Luus, Naweed Khan, Ndivhuwo Makondo, Ismail Yunus Akhalwaya, Haifeng Qian, Ronald Fagin, Francisco Barahona, Udit Sharma, Shajith Ikbal, Hima Karanam, Sumit Neelam, Ankita Likhyani, Santosh K. Srivastava:
Logical Neural Networks. CoRR abs/2006.13155 (2020)
2010 – 2019
- 2019
- [j49]Mourad Baïou, Francisco Barahona
:
Faster Algorithms for Security Games on Matroids. Algorithmica 81(3): 1232-1246 (2019) - [j48]Mourad Baïou, Francisco Barahona
:
An Algorithm to Compute the Nucleolus of Shortest Path Games. Algorithmica 81(8): 3099-3113 (2019) - 2018
- [j47]Mourad Baïou, Francisco Barahona
:
Sparsest cut in planar graphs, maximum concurrent flows and their connections with the max-cut problem. Math. Program. 172(1-2): 59-75 (2018) - [j46]Mourad Baïou
, Francisco Barahona:
On the p-median polytope and the odd directed cycle inequalities: Oriented graphs. Networks 71(4): 326-345 (2018) - 2017
- [c9]Mourad Baïou, Francisco Barahona:
On the Nucleolus of Shortest Path Games. SAGT 2017: 55-66 - 2016
- [j45]Mourad Baïou, Francisco Barahona:
Stackelberg Bipartite Vertex Cover and the Preflow Algorithm. Algorithmica 74(3): 1174-1183 (2016) - [j44]Mourad Baïou, Francisco Barahona:
On the p-median polytope and the directed odd cycle inequalities: Triangle-free oriented graphs. Discret. Optim. 22: 206-224 (2016) - [j43]Mourad Baïou, Francisco Barahona:
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. SIAM J. Discret. Math. 30(2): 1290-1301 (2016) - [c8]Mourad Baïou, Francisco Barahona:
Sparsest Cut in Planar Graphs, Maximum Concurrent Flows and Their Connections with the Max-Cut Problem. IPCO 2016: 63-76 - 2014
- [j42]Mourad Baïou, Francisco Barahona:
On a connection between facility location and perfect graphs. Oper. Res. Lett. 42(6-7): 466-472 (2014) - [j41]Mourad Baïou, Francisco Barahona:
A polyhedral study of a two level facility location model. RAIRO Oper. Res. 48(2): 153-165 (2014) - [c7]Mourad Baïou, Francisco Barahona:
Maximum Weighted Induced Bipartite Subgraphs and Acyclic Subgraphs of Planar Cubic Graphs. IPCO 2014: 88-101 - [c6]Mourad Baïou, Francisco Barahona:
The Dominating Set Polytope via Facility Location. ISCO 2014: 38-49 - [c5]Parijat Dube, João P. M. Gonçalves, Shilpa Mahatma, Francisco Barahona, Milind R. Naphade, Mark Bedeman:
Simulation based analytics for efficient planning and management in multimodal freight transportation industry. WSC 2014: 1943-1954 - 2013
- [c4]Francisco Barahona, Markus Ettl, Marek Petrik, Peter M. Rimshnick:
Agile logistics simulation and optimization for managing disaster responses. WSC 2013: 3340-3351 - 2011
- [j40]Mourad Baïou, Francisco Barahona:
On the linear relaxation of the p-median problem. Discret. Optim. 8(2): 344-375 (2011) - [j39]Mourad Baïou, Francisco Barahona, José Correa:
On the p-Median Polytope and the Intersection Property: Polyhedra and Algorithms. SIAM J. Discret. Math. 25(1): 1-20 (2011) - 2010
- [j38]Mourad Baïou, Francisco Barahona, José Correa:
On the p-median polytope of fork-free graphs. Electron. Notes Discret. Math. 36: 143-149 (2010)
2000 – 2009
- 2009
- [j37]Mourad Baïou, Francisco Barahona:
On the Integrality of Some Facility Location Polytopes. SIAM J. Discret. Math. 23(2): 665-679 (2009) - 2008
- [j36]Mourad Baïou, Francisco Barahona:
On the p-median polytope of Y-free graphs. Discret. Optim. 5(2): 205-219 (2008) - [j35]Mourad Baïou, Francisco Barahona:
A linear programming approach to increasing the weight of all minimum spanning trees. Networks 52(4): 227-234 (2008) - [c3]Mourad Baïou, Francisco Barahona:
On the Location and p-Median Polytopes. Bonn Workshop of Combinatorial Optimization 2008: 1-31 - 2007
- [j34]Francisco Barahona, Pawan Chowdhary, Markus Ettl, Pu Huang, Tracy Kimbrel, Laszlo Ladányi, Young M. Lee, Baruch Schieber, Karthik Sourirajan, Maxim Sviridenko, Grzegorz Swirszcz:
Inventory allocation and transportation scheduling for logistics of network-centric military operations. IBM J. Res. Dev. 51(3/4): 391-408 (2007) - 2006
- [j33]Francisco Barahona:
Network reinforcement. Math. Program. 105(2-3): 181-200 (2006) - [j32]Francisco Barahona, Laszlo Ladányi:
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut. RAIRO Oper. Res. 40(1): 53-73 (2006) - 2005
- [j31]Francisco Barahona, Fabián A. Chudak:
Near-optimal solutions to large-scale facility location problems. Discret. Optim. 2(1): 35-50 (2005) - [j30]Marcos Goycoolea
, Alan T. Murray
, Francisco Barahona, Rafael Epstein, Andrés Weintraub
:
Harvest Scheduling Subject to Maximum Area Restrictions: Exploring Exact Approaches. Oper. Res. 53(3): 490-500 (2005) - 2004
- [j29]Francisco Barahona, Hervé Kerivin:
Separation of partition inequalities with terminals. Discret. Optim. 1(2): 129-140 (2004) - [j28]Francisco Barahona:
Fractional Packing of T-Joins. SIAM J. Discret. Math. 17(4): 661-669 (2004) - 2003
- [j27]Laura Bahiense
, Francisco Barahona, Oscar Porto:
Solving Steiner Tree Problems in Graphs with Lagrangian Relaxation. J. Comb. Optim. 7(3): 259-282 (2003) - 2002
- [j26]Francisco Barahona, Ranga Anbil:
On some difficult linear programs coming from set partitioning. Discret. Appl. Math. 118(1-2): 3-11 (2002) - 2000
- [j25]Mourad Baïou, Francisco Barahona, Ali Ridha Mahjoub:
Separation of Partition Inequalities. Math. Oper. Res. 25(2): 243-254 (2000) - [j24]Francisco Barahona, Ranga Anbil:
The volume algorithm: producing primal solutions with a subgradient method. Math. Program. 87(3): 385-399 (2000) - [j23]Francisco Barahona:
On the k-cut problem. Oper. Res. Lett. 26(3): 99-105 (2000)
1990 – 1999
- 1998
- [j22]Francisco Barahona, David L. Jensen:
Plant location with minimum inventory. Math. Program. 83: 101-111 (1998) - 1996
- [j21]Francisco Barahona:
Network Design Using Cut Inequalities. SIAM J. Optim. 6(3): 823-837 (1996) - 1995
- [j20]Francisco Barahona, Ali Ridha Mahjoub:
On two-connected subgraph polytopes. Discret. Math. 147(1-3): 19-34 (1995) - [j19]Francisco Barahona:
Packing Spanning Trees. Math. Oper. Res. 20(1): 104-115 (1995) - 1994
- [j18]Francisco Barahona, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra I: Balanced Induced Subgraphs and Acyclic Subgraphs. SIAM J. Discret. Math. 7(3): 344-358 (1994) - [j17]Francisco Barahona, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra II: Stable Sets. SIAM J. Discret. Math. 7(3): 359-371 (1994) - [j16]Francisco Barahona, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra III: Graphs with No W4 Minor. SIAM J. Discret. Math. 7(3): 372-389 (1994) - [j15]Francisco Barahona, Jean Fonlupt, Ali Ridha Mahjoub:
Compositions of Graphs and Polyhedra IV: Acyclic Spanning Subgraphs. SIAM J. Discret. Math. 7(3): 390-402 (1994) - 1993
- [j14]Francisco Barahona:
On cuts and matchings in planar graphs. Math. Program. 60: 53-68 (1993) - [j13]Francisco Barahona:
Reducing Matching to Polynomial Size Linear Programming. SIAM J. Optim. 3(4): 688-695 (1993) - 1992
- [j12]Francisco Barahona, Andrés Weintraub
, Rafael Epstein:
Habitat Dispersion in Forest Planning and the Stable Set Problem. Oper. Res. 40(Supplement-1): S14-S21 (1992) - [j11]Francisco Barahona:
Separating from the dominant of the spanning tree polytope. Oper. Res. Lett. 12(4): 201-203 (1992) - [c2]Francisco Barahona, Ali Ridha Mahjoub:
On 2-Connected Subgraph Polytopes. IPCO 1992: 30-43 - 1990
- [c1]Francisco Barahona:
Planar Multicommodity Flows, Max Cut, and the Chinese Postman Problem. Polyhedral Combinatorics 1990: 189-202
1980 – 1989
- 1989
- [j10]Francisco Barahona, Michael Jünger, Gerhard Reinelt:
Experiments in quadratic 0-1 programming. Math. Program. 44(1-3): 127-137 (1989) - [j9]Francisco Barahona, Ali Ridha Mahjoub:
Facets of the balanced (acyclic) induced subgraph polytope. Math. Program. 45(1-3): 21-33 (1989) - [j8]Francisco Barahona, Éva Tardos:
Note on Weintraub's Minimum-Cost Circulation Algorithm. SIAM J. Comput. 18(3): 579-583 (1989) - 1988
- [j7]Francisco Barahona, Martin Grötschel, Michael Jünger, Gerhard Reinelt:
An Application of Combinatorial Optimization to Statistical Physics and Circuit Layout Design. Oper. Res. 36(3): 493-513 (1988) - 1987
- [j6]Francisco Barahona, William R. Pulleyblank:
Exact arborescences, matchings and cycles. Discret. Appl. Math. 16(2): 91-99 (1987) - [j5]Francisco Barahona, Michele Conforti:
A construction for binary matroids. Discret. Math. 66(3): 213-218 (1987) - 1986
- [j4]Francisco Barahona:
A solvable case of quadratic 0-1 programming. Discret. Appl. Math. 13(1): 23-26 (1986) - [j3]Francisco Barahona, Martin Grötschel:
On the cycle polytope of a binary matroid. J. Comb. Theory B 40(1): 40-62 (1986) - [j2]Francisco Barahona, Ali Ridha Mahjoub:
On the cut polytope. Math. Program. 36(2): 157-173 (1986) - 1985
- [j1]Francisco Barahona, Martin Grötschel, Ali Ridha Mahjoub:
Facets of the Bipartite Subgraph Polytope. Math. Oper. Res. 10(2): 340-358 (1985) - 1980
- [b1]Francisco Barahona:
Application de l'optimisation combinatoire à certains modèles de verres de spins : complexité et simulations. Joseph Fourier University, Grenoble, France, 1980

manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
[+][–] Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
[+][–] Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-28 23:33 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
