Zobrazeno 61 - 70
of 104
pro vyhledávání: '"Francisco Barahona"'
Autor:
Francisco Barahona
Publikováno v:
SIAM Journal on Optimization. 3:688-695
The question of whether the maximum weight matching problem can be reduced to a linear program of polynomial size is studied. A partial answer to it is given; i.e., it is shown that the Chinese postman problem (and optimum matching) reduces to a sequ
Autor:
Francisco Barahona
Publikováno v:
Mathematical Programming. 60:53-68
We study the max cut problem in graphs not contractible toK5, and optimum perfect matchings in planar graphs. We prove that both problems can be formulated as polynomial size linear programs.
Autor:
Young O. Kim, Emily Gallagher, Yuri Granik, Kafai Lai, Daniele Paolo Scarpazza, Nick Cobb, Tom Faure, Lei Zhuang, Saeed Bagheri, Alan E. Rosenbluth, Greg McIntyre, Laszlo Ladanyi, Andreas Waechter, Geoffrey W. Burr, Moutaz Fakhry, Michael Lam, Francisco Barahona, Jason E. Meiring, Kehan Tian, David O. S. Melville, Aasutosh Dave, Phil Strenski, Jon Lee, Jaione Tirapu-Azpiroz, Alexander Tritchkov, Hidemasa Muta, Masaharu Sakamoto, Tadanobu Inoue, Azalia A. Krasnoperova, Gabriel Berger, Alfred Wagner, Kostas Adam, Mike Hibbs, Daniel Corliss, Scott Halle
Publikováno v:
SPIE Proceedings.
In recent years the potential of Source-Mask Optimization (SMO) as an enabling technology for 22nm-and-beyond lithography has been explored and documented in the literature.1-5 It has been shown that intensive optimization of the fundamental degrees
Autor:
Saeed Bagheri, Hidemasa Muta, Andreas Waechter, Jaione Tirapu-Azpiroz, Alexander Tritchkov, Tadanobu Inoue, Kafai Lai, Francisco Barahona, Alan E. Rosenbluth, Katya Scheinberg, Masaharu Sakamoto, Yuri Granik, Emily Gallagher, Laszlo Ladanyi, Michael S. Hibbs, David O. S. Melville, Tom Faure, Kehan Tian
Publikováno v:
SPIE Proceedings.
Traditional OPC is essentially an iterated feedback process, in which the position of each target edge is corrected by adjusting a controlling mask edge. However, true optimization adjusts the mask variables collectively, and in so-called SMO approac
Autor:
Mourad Baïou, Francisco Barahona
Publikováno v:
Research Trends in Combinatorial Optimization ISBN: 9783540767954
Bonn Workshop of Combinatorial Optimization
Bonn Workshop of Combinatorial Optimization
We revisit classical systems of linear inequalities associated with location problems and with the p-median problem. We present an overview of the cases for which these linear systems define integral polytopes. We also give polynomial time algorithms
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::315819456468411d8a63239173b74b0c
https://doi.org/10.1007/978-3-540-76796-1_1
https://doi.org/10.1007/978-3-540-76796-1_1
Autor:
Rodolfo Olmos, José Barrancos, Claudia Rivera, Francisco Barahona, Dina L. López, Benancio Henriquez, Agustín Hernández, Efrain Benitez, Pedro A. Hernández, Nemesio M. Pérez, Bo Galle
Publikováno v:
Terrestrial Fluids, Earthquakes and Volcanoes: The Hiroshi Wakita Volume II ISBN: 9783764387198
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9e9746452b1d60844253806552f44908
https://doi.org/10.1007/978-3-7643-8720-4_8
https://doi.org/10.1007/978-3-7643-8720-4_8
Autor:
Pedro A. Hernández, Kenji Notsu, Hiromu Okada, Toshiya Mori, Masanori Sato, Francisco Barahona, Nemesio M. Pérez
Publikováno v:
Pageoph Topical Volumes ISBN: 9783764375805
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f52a6c6283a614b156df89928227976c
https://doi.org/10.1007/3-7643-7584-1_16
https://doi.org/10.1007/3-7643-7584-1_16
Autor:
Nemesio M. Pérez, Pedro A. Hernández, Eleazar Padrón, Rafael Cartagena, Rodolfo Olmos, Francisco Barahona, Gladys Melián, Pedro Salazar, Dina L. López
Publikováno v:
Pageoph Topical Volumes ISBN: 9783764375805
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d23fcbad438bd3468fd992dab096ebed
https://doi.org/10.1007/3-7643-7584-1_17
https://doi.org/10.1007/3-7643-7584-1_17
Autor:
Monique Guignard, Gaston Bravo, Manfred Koenig, Jorge Vera, Francisco Barahona, Andrés Weintraub
Publikováno v:
Pesquisa Operacional, Volume: 23, Issue: 1, Pages: 111-128, Published: JAN 2003
Pesquisa Operacional v.23 n.1 2003
Pesquisa operacional
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
Pesquisa Operacional, Vol 23, Iss 1, Pp 111-128 (2003)
Pesquisa Operacional v.23 n.1 2003
Pesquisa operacional
Sociedade Brasileira de Pesquisa Operacional (SOBRAPO)
instacron:SOBRAPO
Pesquisa Operacional, Vol 23, Iss 1, Pp 111-128 (2003)
The correct location of harvesting machinery is an important problem for the timber industry, as these are expensive pieces of equipment. Also, access roads need to be constructed within a season of harvesting. In this paper, we present the modelling
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9c214b590db56f6c9715fb0fcd4e3d25
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000100009&lng=en&tlng=en
http://www.scielo.br/scielo.php?script=sci_arttext&pid=S0101-74382003000100009&lng=en&tlng=en
Autor:
Francisco Barahona
Publikováno v:
Operations Research Letters. 12:201-203
We study the separation problem for the partition inequalities that define the dominant of the spanning tree polytope of a graph G = (V, E). We show that a most violated inequality can be found by solving at most |V| maximum flow problems. Cunningham