Keyword: pisis
2015 (1)
Linear Bus Holding Model for Real Time Traffic Network Control. Hernández-Landa, L. G., Morales-Marroquín, M. L., Nigenda, R. S., & Ríos-Solís, Y. Á. Mota, M. M., la Mota, I. F. D., & Serrano, D. G., editors. Applied Simulation and Optimization: In Logistics and Industrial, and Aeronautical Practice, pages 303-319. Springer International Publishing, 2015.
![Applied Simulation and Optimization: In Logistics and Industrial, and Aeronautical Practice [link]](https://bibbase.org/img/filetypes/link.svg "link")
Paper doi abstract bibtex
Paper doi abstract bibtex One of the most annoying problems in urban bus operations is bus bunching, which happens when two or more buses arrive at a stop nose to tail. Bus bunching reflects an unreliable service that affects transit operations by increasing passenger-waiting times. This work proposes a linear mathematical programming model that establishes bus holding times at certain stops along a transit corridor to avoid bus bunching. Our approach needs real-time input, so we simulate a transit corridor and apply our mathematical model to the data generated. Thus, the inherent variability of a transit system is considered by the simulation, while the optimization model takes into account the key variables and constraints of the bus operation. Our methodology reduces overall passenger-waiting times efficiently given our linear programming model, with the characteristic of applying control intervals just every 5 minutes.
@InBook{landamoralessanchezrios2014,
author = {Leonardo G. Hernández-Landa and Miguel L. Morales-Marroquín and Romeo Sánchez Nigenda and Yasmín Á. Ríos-Solís},
chapter = {Linear Bus Holding Model for Real Time Traffic Network Control},
title = {Applied Simulation and Optimization: In Logistics and Industrial, and Aeronautical Practice},
publisher={Springer International Publishing},
year = {2015},
editor = {Miguel Mujica Mota and Idalia Flores De la Mota and Daniel Guimarans Serrano},
ISBN = {978-3-319-15032-1},
url = {http://www.springer.com/mathematics/computational+science+%26+engineering/book/978-3-319-15032-1},
doi={10.1007/978-3-319-15033-8_10},
abstract = {One of the most annoying problems in urban bus operations is bus bunching, which happens when two or more buses arrive at a stop nose to tail. Bus bunching reflects an unreliable service that affects transit operations by increasing passenger-waiting times. This work proposes a linear mathematical programming model that establishes bus holding times at certain stops along a transit corridor to avoid bus bunching. Our approach needs real-time input, so we simulate a transit corridor and apply our mathematical model to the data generated. Thus, the inherent variability of a transit system is considered by
the simulation, while the optimization model takes into account the key variables
and constraints of the bus operation. Our methodology reduces overall passenger-waiting times efficiently given our linear programming model, with the characteristic of applying control intervals just every 5 minutes.},
pages={303-319},
keywords = {pisis, bus bunching, linear programming, simulation}
}2014 (5)
A crop planning and real-time irrigation method based on site-specific management zones and linear programming. Cid-Garcia, N. M, Bravo-Lozano, A. G, & Rios-Solis, Y. A Computers and Electronics in Agriculture, 107:20--28, Elsevier, 2014.
bibtex
bibtex
@article{cid2014crop,
title={A crop planning and real-time irrigation method based on site-specific management zones and linear programming},
author={Cid-Garcia, Nestor M and Bravo-Lozano, Angel G and Rios-Solis, Yasmin A},
journal={Computers and Electronics in Agriculture},
volume={107},
pages={20--28},
year={2014},
publisher={Elsevier},
keywords = {pisis}
}Introducing Simulated Annealing in Partial Order Planning. A., R. L. G., Sanchez, R., & Berrones, A. In Proceedings of the 13th Mexican International Conference on Artificial Intelligence (MICAI 2014), November, 2014.
abstract bibtex
abstract bibtex
One of the most popular algorithms in the field of domain independent planning is POP - partial order planning. POP considers a least commitment strategy to solve planning problems. Such strategy delays commitments during the planning phase until it is absolutely necessary. In consequence, the algorithm provides greater flexibility for solving planning problems, but with a higher cost in performance. POP-based techniques do not consider search states; instead, search nodes represent partial plans. Recent advances in planning on distance based heuristics and reachability analysis have helped POP planners to solve more planning problems than before. Although such heuristic techniques have demonstrated to boost performance for POP algorithms, they still remain behind state space planners. We believe that this is mainly due to the partial order representation of the search nodes in POP. In this article, instead of proposing additional heuristics for POP, we enable POP to consider different areas of its search space. We think that the basic POP algorithm follows a greedy path in the search space suffering from local optima problems, from where it cannot recover. To this extent, we have augmented POP with a simulated annealing procedure, which considers worst solutions with certain probability. The augmented algorithm produces promising results in our empirical evaluation, returning 19% more solutions in the problems being considered.
@InProceedings{sanchez2014micai,
author = {Rosa L. González A. and Romeo Sanchez and Arturo Berrones},
title = {Introducing Simulated Annealing in Partial Order Planning},
booktitle = {Proceedings of the 13th Mexican International Conference on Artificial Intelligence (MICAI 2014)},
year = {2014},
month = {November},
abstract = {One of the most popular algorithms in the field of domain independent planning is POP - partial order planning. POP considers a least commitment strategy to solve planning problems. Such strategy delays commitments during the planning phase until it is absolutely
necessary. In consequence, the algorithm provides greater flexibility for solving planning problems, but with a higher cost in performance. POP-based techniques do not consider search states; instead, search nodes represent partial plans. Recent advances in planning on distance based heuristics and reachability analysis have helped POP planners to solve more planning problems than before. Although such heuristic techniques have demonstrated to boost performance for POP algorithms, they still remain behind state space planners. We believe that this is mainly due to the partial order representation of the search nodes in POP. In this article, instead of proposing additional heuristics for POP, we enable POP to consider different areas of its search space. We think that the basic POP algorithm follows a greedy path in the search space suffering from local optima problems, from where it cannot recover. To this extent, we have augmented POP with a simulated annealing procedure, which considers
worst solutions with certain probability. The augmented algorithm produces promising results in our empirical evaluation, returning 19% more solutions in the problems being considered.},
keywords = {pisis, planning algorithms, partial-order planning}
}Integer Programming Formulations for Approximate Packing Circles in a Rectangular Container. Litvinchev, I. & Ozuna Espinosa, E. L. Mathematical Problems in Engineering, Hindawi Publishing Corporation, 2014.
bibtex
bibtex
@article{litvinchev2014integer,
title={Integer Programming Formulations for Approximate Packing Circles in a Rectangular Container},
author={Litvinchev, Igor and Ozuna Espinosa, Edith Lucero},
journal={Mathematical Problems in Engineering},
volume={2014},
year={2014},
publisher={Hindawi Publishing Corporation},
keywords = {pisis}
}Linear Bus Holding Model for Real Time Traffic Network Control. Hernández-Landa, L. G., Morales-Marroquín, M. L., Nigenda, R. S., & Ríos-Solís, Y. Á. Mota, M. M., la Mota, I.<nbsp>F.<nbsp>D., & Serrano, D. G., editors. Applied Simulation and Optimization: In Logistics and Industrial, and Aeronautical Practice. Springer, 2014. To appear August 2015
Paper abstract bibtex
Paper abstract bibtex One of the most annoying problems in urban bus operations is bus bunching, which happens when two or more buses arrive at a stop nose to tail. Bus bunching reflects an unreliable service that affects transit operations by increasing passenger-waiting times. This work proposes a linear mathematical programming model that establishes bus holding times at certain stops along a transit corridor to avoid bus bunching. Our approach needs real-time input, so we simulate a transit corridor and apply our mathematical model to the data generated. Thus, the inherent variability of a transit system is considered by the simulation, while the optimization model takes into account the key variables and constraints of the bus operation. Our methodology reduces overall passenger-waiting times efficiently given our linear programming model, with the characteristic of applying control intervals just every 5 minutes.
@inbook{ landamoralessanchezrios2014,
author = {Leonardo G. Hernández-Landa and Miguel L. Morales-Marroquín and Romeo Sánchez Nigenda and Yasmín Á. Ríos-Solís},
chapter = {Linear Bus Holding Model for Real Time Traffic Network Control},
title = {Applied Simulation and Optimization: In Logistics and Industrial, and Aeronautical Practice},
publisher = {Springer},
year = {2014},
editor = {Miguel Mujica Mota and Idalia Flores De la Mota and Daniel Guimarans Serrano},
isbn = {978-3-319-15032-1},
url = {http://www.springer.com/mathematics/computational+science+%26+engineering/book/978-3-319-15032-1},
abstract = {One of the most annoying problems in urban bus operations is bus bunching, which happens when two or more buses arrive at a stop nose to tail. Bus bunching reflects an unreliable service that affects transit operations by increasing passenger-waiting times. This work proposes a linear mathematical programming model that establishes bus holding times at certain stops along a transit corridor to avoid bus bunching. Our approach needs real-time input, so we simulate a transit corridor and apply our mathematical model to the data generated. Thus, the inherent variability of a transit system is considered by
the simulation, while the optimization model takes into account the key variables
and constraints of the bus operation. Our methodology reduces overall passenger-waiting times efficiently given our linear programming model, with the characteristic of applying control intervals just every 5 minutes.},
note = {To appear August 2015},
keywords = {pisis, bus bunching, linear programming, simulation}
}A bi-objective vehicle routing problem with time windows: A real case in Tenerife. Melián-Batista, B., De Santiago, A., AngelBello, F., & Alvarez, A. Applied Soft Computing, 17:140--152, Elsevier, 2014.
bibtex
bibtex
@article{melian2014bi,
title={A bi-objective vehicle routing problem with time windows: A real case in Tenerife},
author={Meli{\'a}n-Batista, Bel{\'e}n and De Santiago, Alondra and AngelBello, Francisco and Alvarez, Ada},
journal={Applied Soft Computing},
volume={17},
pages={140--152},
year={2014},
publisher={Elsevier},
keywords = {pisis}
}2013 (9)
Conceptual model of coalescence and break-up in the presence of external agitation. Almaguer, F, Alcalá, M., Berrones, A., Chacón-Mondragón, Ó. L, Soto-Regalado, E., & others Physica A: Statistical Mechanics and its Applications, 392(8):1725--1732, Elsevier, 2013.
bibtex
bibtex
@article{almaguer2013conceptual,
title={Conceptual model of coalescence and break-up in the presence of external agitation},
author={Almaguer, F and Alcal{\'a}, M{\'o}nica and Berrones, Arturo and Chac{\'o}n-Mondrag{\'o}n, {\'O}scar L and Soto-Regalado, Eduardo and others},
journal={Physica A: Statistical Mechanics and its Applications},
volume={392},
number={8},
pages={1725--1732},
year={2013},
publisher={Elsevier},
keywords = {pisis}
}Effect of the initial solutions to balance routes in vehicle routing problem with time windows. De Santiago, A., Melián-Batista, B., Álvarez, A., & AngelBello, F. In Advances in Computational Intelligence, pages 46--52. Springer Berlin Heidelberg, 2013.
bibtex
bibtex
@incollection{de2013effect,
title={Effect of the initial solutions to balance routes in vehicle routing problem with time windows},
author={De Santiago, Alondra and Meli{\'a}n-Batista, Bel{\'e}n and {\'A}lvarez, Ada and AngelBello, Francisco},
booktitle={Advances in Computational Intelligence},
pages={46--52},
year={2013},
publisher={Springer Berlin Heidelberg},
keywords = {pisis}
}Lagrangian Heuristic for the Facility Location Problem. Ozuna, E. L. & Litvinchev, I. In Management and Control of Production and Logistics, volume 6, pages 107--113, 2013.
bibtex
bibtex
@inproceedings{ozuna2013lagrangian,
title={Lagrangian Heuristic for the Facility Location Problem},
author={Ozuna, Edith Lucero and Litvinchev, Igor},
booktitle={Management and Control of Production and Logistics},
volume={6},
number={1},
pages={107--113},
year={2013},
keywords = {pisis}
}Routing Vehicles in a Special Transportation Network. Infante Rivera, L. A. & Litvinchev, I. In Management and Control of Production and Logistics, volume 6, pages 385--387, 2013.
bibtex
bibtex
@inproceedings{infante2013routing,
title={Routing Vehicles in a Special Transportation Network},
author={Infante Rivera, Luis Alfonso and Litvinchev, Igor},
booktitle={Management and Control of Production and Logistics},
volume={6},
number={1},
pages={385--387},
year={2013},
keywords = {pisis}
}Sow-activity classification from acceleration patterns: A machine learning approach. Escalante, H. J., Rodriguez, S. V, Cordero, J., Kristensen, A. R., & Cornou, C. Computers and Electronics in Agriculture, 93:17--26, Elsevier, 2013.
bibtex
bibtex
@article{escalante2013sow,
title={Sow-activity classification from acceleration patterns: A machine learning approach},
author={Escalante, Hugo Jair and Rodriguez, Sara V and Cordero, Jorge and Kristensen, Anders Ringgaard and Cornou, C{\'e}cile},
journal={Computers and Electronics in Agriculture},
volume={93},
pages={17--26},
year={2013},
publisher={Elsevier},
keywords = {pisis}
}Resilience and optimization of identifiable bipartite graphs. Fritzilas, E., Milanič, M., Monnot, J., & Rios-Solis, Y. A Discrete Applied Mathematics, 161(4):593--603, North-Holland, 2013.
bibtex
bibtex
@article{fritzilas2013resilience,
title={Resilience and optimization of identifiable bipartite graphs},
author={Fritzilas, Epameinondas and Milani{\v{c}}, Martin and Monnot, J{\'e}r{\^o}me and Rios-Solis, Yasmin A},
journal={Discrete Applied Mathematics},
volume={161},
number={4},
pages={593--603},
year={2013},
publisher={North-Holland},
keywords = {pisis}
}Rectangular shape management zone delineation using integer linear programming. Cid-Garcia, N. M, Albornoz, V., Rios-Solis, Y. A, & Ortega, R. Computers and Electronics in Agriculture, 93:1--9, Elsevier, 2013.
bibtex
bibtex
@article{cid2013rectangular,
title={Rectangular shape management zone delineation using integer linear programming},
author={Cid-Garcia, Nestor M and Albornoz, Victor and Rios-Solis, Yasmin A and Ortega, Rodrigo},
journal={Computers and Electronics in Agriculture},
volume={93},
pages={1--9},
year={2013},
publisher={Elsevier},
keywords = {pisis}
}GRASP Strategies for a Bi-objective Commercial Territory Design Problem. Salazar-Aguilar, M. A., Ríos-Mercado, R. Z., & González-Velarde, J. L. Journal of Heuristics, 19(2):179--200, 2013.
bibtex
bibtex
@ARTICLE{joh-2013,
AUTHOR = "M. A. Salazar-Aguilar and R. Z. R\'{\i}os-Mercado and J. L. Gonz\'{a}lez-Velarde ",
TITLE = "{GRASP} Strategies for a Bi-objective Commercial Territory Design Problem",
JOURNAL = "Journal of Heuristics",
YEAR = "2013" ,
volume = "19" ,
number = "2",
pages = "179--200",
keywords = "pisis" }A Reformulation for the Problem of Scheduling Unrelated Parallel Machines with Sequence and Machine Dependent Setup Times. Avalos-Rosales, O., Alvarez, A. M., & Angel-Bello, F. In ICAPS, 2013.
bibtex
bibtex
@inproceedings{avalos2013reformulation,
title={A Reformulation for the Problem of Scheduling Unrelated Parallel Machines with Sequence and Machine Dependent Setup Times.},
author={Avalos-Rosales, Oliver and Alvarez, Ada Margarita and Angel-Bello, Francisco},
booktitle={ICAPS},
year={2013},
keywords = {pisis}
}2012 (9)
LAGRANGIAN HEURISTIC FOR THE TWO-STAGE CAPACITATED FACILITY LOCATION PROBLEM. Litvinchev, I., Mata, M, & Ozuna, L APPLIED AND COMPUTATIONAL MATHEMATICS, 11(1):137--146, AZERBAIJAN NATIONAL ACAD SCI BAKU STATE UNIV, INST APPLIED MATHEMATICS, Z KHALILOV STR 23, BAKU, AZ 1148, AZERBAIJAN, 2012.
bibtex
bibtex
@article{litvinchev2012lagrangian,
title={LAGRANGIAN HEURISTIC FOR THE TWO-STAGE CAPACITATED FACILITY LOCATION PROBLEM},
author={Litvinchev, IS and Mata, M and Ozuna, L},
journal={APPLIED AND COMPUTATIONAL MATHEMATICS},
volume={11},
number={1},
pages={137--146},
year={2012},
publisher={AZERBAIJAN NATIONAL ACAD SCI BAKU STATE UNIV, INST APPLIED MATHEMATICS, Z KHALILOV STR 23, BAKU, AZ 1148, AZERBAIJAN},
keywords = {pisis}
}Commercial Territory Design for a Distribution Firm with New Constructive and Destructive Heuristics. Cano-Belmán, J., Ríos-Mercado, R. Z., & Salazar-Aguilar, M. A. International Journal of Computational Intelligence Systems, 5(1):126--147, 2012.
bibtex
bibtex
@ARTICLE{ijcis-2012,
AUTHOR = "J. Cano-Belm\'an and R. Z. R\'{\i}os-Mercado and M. A. Salazar-Aguilar",
TITLE = "Commercial Territory Design for a Distribution Firm with New Constructive
and Destructive Heuristics",
JOURNAL = "International Journal of Computational Intelligence Systems",
YEAR = "2012" ,
volume = "5" ,
number = "1",
pages = "126--147",
note = "",
keywords = "pisis" }Solving knapsack problems on GPU. Boyer, V., El Baz, D., & Elkihel, M. Computers & Operations Research, 39(1):42--47, Pergamon, 2012.
bibtex
bibtex
@article{boyer2012solving,
Author = {Boyer, Vincent and El Baz, Didier and Elkihel, Moussa},
Journal = {Computers \& Operations Research},
Number = {1},
Pages = {42--47},
Publisher = {Pergamon},
Title = {Solving knapsack problems on GPU},
Volume = {39},
Year = {2012},
keywords = {pisis}}Multiobjective Scatter Search for a Commercial Territory Design Problem. Salazar-Aguilar, M. A., Ríos-Mercado, R. Z., González-Velarde, J. L., & Molina, J. 199(1):343--360, 2012.
bibtex
bibtex
@ARTICLE{aor-2012,
AUTHOR = "M. A. Salazar-Aguilar and R. Z. R\'{\i}os-Mercado and J. L. Gonz\'{a}lez-Velarde
and J. Molina",
TITLE = "Multiobjective Scatter Search for a Commercial Territory Design Problem",
JOURNAL = ANOR,
YEAR = "2012" ,
volume = "199" ,
number = "1",
pages = "343--360",
keywords = "pisis" }A procedure--based heuristic for 0--1 Multiple Knapsack Problems. Lalami, M. E., Elkihel, M., Baz, D. E., & Boyer, V. International Journal of Mathematics in Operational Research, 4(3):214--224, Inderscience, 2012.
bibtex
bibtex
@article{lalami2012procedure,
Author = {Lalami, Mohamed Esseghir and Elkihel, Moussa and Baz, Didier El and Boyer, Vincent},
Journal = {International Journal of Mathematics in Operational Research},
Number = {3},
Pages = {214--224},
Publisher = {Inderscience},
Title = {A procedure--based heuristic for 0--1 Multiple Knapsack Problems},
Volume = {4},
Year = {2012},
keywords = {pisis}}Solution to the Social Portfolio Problem by Evolutionary Algorithms. Zarate, G. R., Santillán, C. G., Reyes, L. C., Rodriguez, R. G., Jaramillo, F. B., González, E. F., & Irarragorri, F. L. International Journal, 2012.
bibtex
bibtex
@article{zarate2012solution,
title={Solution to the Social Portfolio Problem by Evolutionary Algorithms},
author={Zarate, Gilberto Rivera and Santill{\'a}n, Claudia G{\'o}mez and Reyes, Laura Cruz and Rodriguez, Rogelio Garc{\'\i}a and Jaramillo, Fausto Balderas and Gonz{\'a}lez, Eduardo Fernandez and Irarragorri, Fernando L{\'o}pez},
journal={International Journal},
volume={3},
year={2012},
keywords = {pisis}
}Synchronization of bus timetabling. Ibarra-Rojas, O. J & Rios-Solis, Y. A Transportation Research Part B: Methodological, 46(5):599--614, Pergamon, 2012.
bibtex
bibtex
@article{ibarra2012synchronization,
title={Synchronization of bus timetabling},
author={Ibarra-Rojas, Omar J and Rios-Solis, Yasmin A},
journal={Transportation Research Part B: Methodological},
volume={46},
number={5},
pages={599--614},
year={2012},
publisher={Pergamon},
keywords = {pisis}
}Distributed part differentiation in a smart surface. El Baz, D., Boyer, V., Bourgeois, J., Dedu, E., & Boutoustous, K. Mechatronics, 22(5):522--530, Elsevier, 2012.
bibtex
bibtex
@article{el2012distributed,
Author = {El Baz, Didier and Boyer, Vincent and Bourgeois, Julien and Dedu, Eugen and Boutoustous, Kahina},
Journal = {Mechatronics},
Number = {5},
Pages = {522--530},
Publisher = {Elsevier},
Title = {Distributed part differentiation in a smart surface},
Volume = {22},
Year = {2012},
keywords = {pisis}}Solving the two-stage capacitated facility location problem by the lagrangian heuristic. Litvinchev, I. & Espinosa, E. L. O. In Computational Logistics, pages 92--103. Springer Berlin Heidelberg, 2012.
bibtex
bibtex
@incollection{litvinchev2012solving,
title={Solving the two-stage capacitated facility location problem by the lagrangian heuristic},
author={Litvinchev, Igor and Espinosa, Edith Lucero Ozuna},
booktitle={Computational Logistics},
pages={92--103},
year={2012},
publisher={Springer Berlin Heidelberg},
keywords = {pisis}
}2011 (6)
A Bi-objective Programming Model for Designing Compact and Balanced Territories in Commercial Districting. Salazar-Aguilar, M. A., Ríos-Mercado, R. Z., & González-Velarde, J. L. Transportation Research Part C: Emerging Technologies, 19(5):885--895, 2011.
bibtex
bibtex
@ARTICLE{trc-2011,
AUTHOR = "M. A. Salazar-Aguilar and R. Z. R\'{\i}os-Mercado and J. L. Gonz\'{a}lez-Velarde ",
TITLE = "A Bi-objective Programming Model for Designing Compact and Balanced Territories in Commercial Districting",
JOURNAL = "Transportation Research Part C: Emerging Technologies",
YEAR = "2011" ,
volume = "19" ,
number = "5",
pages = "885--895",
note = "",
keywords = "pisis" }Increasing selective pressure towards the best compromise in evolutionary multiobjective optimization: the extended NOSGA method. Fernandez, E., Lopez, E., Lopez, F., & Coello Coello, C. A Information Sciences, 181(1):44--56, Elsevier, 2011.
bibtex
bibtex
@article{fernandez2011increasing,
title={Increasing selective pressure towards the best compromise in evolutionary multiobjective optimization: the extended NOSGA method},
author={Fernandez, Eduardo and Lopez, Edy and Lopez, Fernando and Coello Coello, Carlos A},
journal={Information Sciences},
volume={181},
number={1},
pages={44--56},
year={2011},
publisher={Elsevier},
keywords = {pisis}
}A milp bi-objective model for static portfolio selection of R&D projects with synergies. Litvinchev, I, López, F, Escalante, H., & Mata, M Journal of Computer and Systems Sciences International, 50(6):942--952, SP MAIK Nauka/Interperiodica, 2011.
bibtex
bibtex
@article{litvinchev2011milp,
title={A milp bi-objective model for static portfolio selection of R\&D projects with synergies},
author={Litvinchev, I and L{\'o}pez, F and Escalante, HJ and Mata, M},
journal={Journal of Computer and Systems Sciences International},
volume={50},
number={6},
pages={942--952},
year={2011},
publisher={SP MAIK Nauka/Interperiodica},
keywords = {pisis}
}Optimal policies for constrained average-cost Markov decision processes. González-Hernández, J. & Villarreal, C. E Top, 19(1):107--120, Springer-Verlag, 2011.
bibtex
bibtex
@article{gonzalez2011optimal,
title={Optimal policies for constrained average-cost Markov decision processes},
author={Gonz{\'a}lez-Hern{\'a}ndez, Juan and Villarreal,
C{\'e}sar E},
journal={Top},
volume={19},
number={1},
pages={107--120},
year={2011},
publisher={Springer-Verlag},
keywords = {pisis}
}An integrated model for the frequency and timetabling problem. Torres, P. A. A., Irarragorri, F. L., & Fernández, R. C. 2011.
bibtex
bibtex
@article{torres2011integrated,
title={An integrated model for the frequency and timetabling problem},
author={Torres, Paulina Alejandra Avila and Irarragorri, Fernando L{\'o}pez and Fern{\'a}ndez, Rafael Caballero},
year={2011},
keywords = {pisis}
}Integrating synchronization bus timetabling and single-depot single-type vehicle scheduling. Ibarra-Rojas, O. J & Rios-Solis, Y. A In ORP3 meeting, Cádiz España, pages 1--4, 2011. ORP3.
bibtex
bibtex
@inproceedings{ibarra2011integrating,
title={Integrating synchronization bus timetabling and single-depot single-type vehicle scheduling},
author={Ibarra-Rojas, Omar J and Rios-Solis, Yasmin A},
booktitle={ORP3 meeting, C{\'a}diz Espa{\~n}a},
pages={1--4},
year={2011},
organization={ORP3},
keywords = {pisis}
}2010 (7)
Structural identifiability in low-rank matrix factorization. Fritzilas, E., Milanič, M., Rahmann, S., & Rios-Solis, Y. A Algorithmica, 56(3):313--332, Springer-Verlag, 2010.
bibtex
bibtex
@article{fritzilas2010structural,
title={Structural identifiability in low-rank matrix factorization},
author={Fritzilas, Epameinondas and Milani{\v{c}}, Martin and Rahmann, Sven and Rios-Solis, Yasmin A},
journal={Algorithmica},
volume={56},
number={3},
pages={313--332},
year={2010},
publisher={Springer-Verlag},
keywords = {pisis}
}Cotas lagrangianas para el problema de localización capacitado en dos etapas. Litvinchev, I., Ozuna, E. L, & Mata, M. Anais do CNMAC, 3:1114--1115, 2010.
bibtex
bibtex
@article{litvinchev2010cotas,
title={Cotas lagrangianas para el problema de localizaci{\'o}n capacitado en dos etapas},
author={Litvinchev, Igor and Ozuna, Edith L and Mata, Miguel},
journal={Anais do CNMAC},
volume={3},
pages={1114--1115},
year={2010},
keywords = {pisis}
}A computational tool for optimizing the urban public transport: A real application. Álvarez, A, Casado, S, Velarde, J. G., & Pacheco, J Journal of Computer and Systems Sciences International, 49(2):244--252, SP MAIK Nauka/Interperiodica, 2010.
bibtex
bibtex
@article{alvarez2010computational,
title={A computational tool for optimizing the urban public transport: A real application},
author={{\'A}lvarez, A and Casado, S and Velarde, JL Gonz{\'a}lez and Pacheco, J},
journal={Journal of Computer and Systems Sciences International},
volume={49},
number={2},
pages={244--252},
year={2010},
publisher={SP MAIK Nauka/Interperiodica},
keywords = {pisis}
}Lagrangian heuristic for a class of the generalized assignment problems. Litvinchev, I., Mata, M., Rangel, S., & Saucedo, J. Computers & Mathematics with Applications, 60(4):1115--1123, Elsevier, 2010.
bibtex
bibtex
@article{litvinchev2010lagrangian,
title={Lagrangian heuristic for a class of the generalized assignment problems},
author={Litvinchev, Igor and Mata, Miguel and Rangel, Socorro and Saucedo, Jania},
journal={Computers \& Mathematics with Applications},
volume={60},
number={4},
pages={1115--1123},
year={2010},
publisher={Elsevier},
keywords = {pisis}
}Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations. Plateau, M. & Rios-Solis, Y. A European Journal of Operational Research, 201(3):729--736, North-Holland, 2010.
bibtex
bibtex
@article{plateau2010optimal,
title={Optimal solutions for unrelated parallel machines scheduling problems using convex quadratic reformulations},
author={Plateau, M-C and Rios-Solis, Yasmin A},
journal={European Journal of Operational Research},
volume={201},
number={3},
pages={729--736},
year={2010},
publisher={North-Holland},
keywords = {pisis}
}Large-scale public R&D portfolio selection by maximizing a biobjective impact measure. Litvinchev, I. S, López, F., Alvarez, A., & Fernández, E. Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on, 40(3):572--582, IEEE, 2010.
bibtex
bibtex
@article{litvinchev2010large,
title={Large-scale public R\&D portfolio selection by maximizing a biobjective impact measure},
author={Litvinchev, Igor S and L{\'o}pez, Fernando and Alvarez, Ada and Fern{\'a}ndez, Eduardo},
journal={Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on},
volume={40},
number={3},
pages={572--582},
year={2010},
publisher={IEEE},
keywords = {pisis}
}GRASP strategies for a bi-objective commercial territory design problem. Salazar-Aguilar, M. A., Ríos-Mercado*, R. Z., & González-Velarde, J. L. Technical Report Graduate Program in Systems Engineering, UANL, San Nicolás de los Garza, México, January, 2010. PISIS-2010-01.
![GRASP strategies for a bi-objective commercial territory design problem [pdf]](https://bibbase.org/img/filetypes/pdf.svg "pdf")
Paper bibtex
Paper bibtex @TechReport{pisisTR-2010-01,
author = {M. A. Salazar-Aguilar and R. Z. Ríos-Mercado* and J. L. González-Velarde},
title = {GRASP strategies for a bi-objective commercial territory design problem},
institution = {Graduate Program in Systems Engineering, UANL},
year = {2010},
address = {San Nicolás de los Garza, México},
url = {https://googledrive.com/host/0B92aE0wdpf7TdnVHSTJaMWgxYTg/2010/pisis-2010-01.pdf},
month = {January},
note = {PISIS-2010-01.}
}2009 (7)
An integrated mathematical-computer approach for R&D project selection in large public organisations. Fernandez, E., Lopez, F., Navarro, J., & Vega, I. International Journal of Mathematics in Operational Research, 1(3):372--396, Inderscience, 2009.
bibtex
bibtex
@article{fernandez2009integrated,
title={An integrated mathematical-computer approach for R\&D project selection in large public organisations},
author={Fernandez, Eduardo and Lopez, Fernando and Navarro, Jorge and Vega, Ines},
journal={International Journal of Mathematics in Operational Research},
volume={1},
number={3},
pages={372--396},
year={2009},
publisher={Inderscience},
keywords = {pisis}
}A tabu search approach to an urban transport problem in northern Spain. Pacheco, J., Alvarez, A., Casado, S., & González-Velarde, J. L. Computers & Operations Research, 36(3):967--979, Elsevier, 2009.
bibtex
bibtex
@article{pacheco2009tabu,
title={A tabu search approach to an urban transport problem in northern Spain},
author={Pacheco, Joaqu{\'\i}n and Alvarez, Ada and Casado, Silvia and Gonz{\'a}lez-Velarde, Jos{\'e} Luis},
journal={Computers \& Operations Research},
volume={36},
number={3},
pages={967--979},
year={2009},
publisher={Elsevier},
keywords = {pisis}
}Diseño de territorios comerciales con múltiples objetivos. Olivares Benítez, E., González Velarde, J. L., & Ríos-Mercado, R. Z. In Proceedings of the 4th Meeting of the Ibero-american Network on Multicriteria Decision and Evaluation (RED-M'09), pages 1--4, Zapopan, Mexico, November, 2009. ISBN: 978-970-764-849-4
bibtex
bibtex
@INPROCEEDINGS{cp:redm-2009,
AUTHOR = "E. {Olivares Ben\'{\i}tez} and J. L. {Gonz\'alez Velarde}
and R. Z. R\'{\i}os-Mercado",
TITLE = "Diseño de territorios comerciales con múltiples objetivos",
BOOKTITLE = "Proceedings of the 4th Meeting of the Ibero-american
Network on Multicriteria Decision and Evaluation (RED-M'09)",
YEAR = "2009",
editor = "J. C. Leyva L\'opez",
pages = "1--4",
organization = "",
publisher = "",
address = "Zapopan, Mexico",
month = "November",
note = " ISBN: 978-970-764-849-4",
keywords = "pisis" }On the problem of including maintenance activities in production planning. Ángel-Bello, F., Álvarez*, A. M., Pacheco, J., & Martínez, I. Technical Report Graduate Program in Systems Engineering, UANL, San Nicolás de los Garza, México, May, 2009. PISIS-2009-02.
Paper bibtex
Paper bibtex @TechReport{pisisTR-2009-02,
author = {F. Ángel-Bello and A. M. Álvarez* and J. Pacheco and I. Martínez},
title = {On the problem of including maintenance activities in production planning},
institution = {Graduate Program in Systems Engineering, UANL},
year = {2009},
address = {San Nicolás de los Garza, México},
url = {https://googledrive.com/host/0B92aE0wdpf7TdnVHSTJaMWgxYTg/2009/pisis-2009-02.pdf},
month = {May},
note = {PISIS-2009-02.}
}Characterization of the convergence of stationary Fokker-Planck learning. Berrones*, A. Technical Report Graduate Program in Systems Engineering, UANL, San Nicolás de los Garza, México, June, 2009. PISIS-2009-03.
Paper bibtex
Paper bibtex @TechReport{pisisTR-2009-03,
author = {A. Berrones*},
title = {Characterization of the convergence of stationary Fokker-Planck learning},
institution = {Graduate Program in Systems Engineering, UANL},
year = {2009},
address = {San Nicolás de los Garza, México},
url = {https://googledrive.com/host/0B92aE0wdpf7TdnVHSTJaMWgxYTg/2009/pisis-2009-03.pdf},
month = {June},
note = {PISIS-2009-03.}
}New models for commercial territory design. Salazar-Aguilar*, M. A., Ríos-Mercado*, R. Z., & Cabrera-Ríos, M. Technical Report Graduate Program in Systems Engineering, UANL, San Nicolás de los Garza, México, December, 2009. PISIS-2009-07.
Paper bibtex
Paper bibtex @TechReport{pisisTR-2009-07,
author = {M. A. Salazar-Aguilar* and R. Z. Ríos-Mercado* and M. Cabrera-Ríos},
title = {New models for commercial territory design},
institution = {Graduate Program in Systems Engineering, UANL},
year = {2009},
address = {San Nicolás de los Garza, México},
url = {https://googledrive.com/host/0B92aE0wdpf7TdnVHSTJaMWgxYTg/2009/pisis-2009-07.pdf},
month = {December},
note = {PISIS-2009-07.}
}Constructing efficient commercial territory design plans for a beverage distribution firm with a bi-objective programming model. Salazar-Aguilar*, M. A., Ríos-Mercado*, R. Z., & González-Velarde, J. L. Technical Report Graduate Program in Systems Engineering, UANL, San Nicolás de los Garza, México, December, 2009. PISIS-2009-08.
Paper bibtex
Paper bibtex @TechReport{pisisTR-2009-08,
author = {M. A. Salazar-Aguilar* and R. Z. Ríos-Mercado* and J. L. González-Velarde},
title = {Constructing efficient commercial territory design plans for a beverage distribution firm with a bi-objective programming model},
institution = {Graduate Program in Systems Engineering, UANL},
year = {2009},
address = {San Nicolás de los Garza, México},
url = {https://googledrive.com/host/0B92aE0wdpf7TdnVHSTJaMWgxYTg/2009/pisis-2009-08.pdf},
month = {December},
note = {PISIS-2009-08.}
}2008 (10)
Heuristic solutions for locating health resources. Pacheco, J. A, Casado, S., Alegre, J. F, & Álvarez, A. Intelligent Systems, IEEE, 23(1):57--63, IEEE, 2008.
bibtex
bibtex
@article{pacheco2008heuristic,
title={Heuristic solutions for locating health resources},
author={Pacheco, Joaquin A and Casado, Silvia and Alegre, Jes{\'u}s F and {\'A}lvarez, Ada},
journal={Intelligent Systems, IEEE},
volume={23},
number={1},
pages={57--63},
year={2008},
publisher={IEEE},
keywords = {pisis}
}Learning Probability Densities of Optimization Problems with Constraints and Uncertainty. Velasco, J., Muñiz, A. L., & Berrones, A. In MICAI 2008: Advances in Artificial Intelligence, pages 266--272. Springer, 2008.
bibtex
bibtex
@incollection{velasco2008learning,
title={Learning Probability Densities of Optimization Problems with Constraints and Uncertainty},
author={Velasco, Jon{\'a}s and Mu{\~n}iz, Ayde{\'e} L{\'o}pez and Berrones, Arturo},
booktitle={MICAI 2008: Advances in Artificial Intelligence},
pages={266--272},
year={2008},
publisher={Springer},
keywords = {pisis}
}Lower bounds for the earliness--tardiness scheduling problem on parallel machines with distinct due dates. Kedad-Sidhoum, S., Solis, Y. R., & Sourd, F. European Journal of Operational Research, 189(3):1305--1316, North-Holland, 2008.
bibtex
bibtex
@article{kedad2008lower,
title={Lower bounds for the earliness--tardiness scheduling problem on parallel machines with distinct due dates},
author={Kedad-Sidhoum, Safia and Solis, Yasmin Rios and Sourd, Francis},
journal={European Journal of Operational Research},
volume={189},
number={3},
pages={1305--1316},
year={2008},
publisher={North-Holland},
keywords = {pisis}
}Usando Herramientas de MILP para Estudiar el Modelo de Selección de Portafolios R&D para Casos de Grandes Carteras de Proyectos en el Sector Social. Litvinchev, I., López Irarragorri, F., Mata Pérez, M., & Schaeffer, E. Computación y Sistemas, 12(2):163--172, Centro de Investigación en Computación, IPN, 2008.
bibtex
bibtex
@article{litvinchev2008usando,
title={Usando Herramientas de MILP para Estudiar el Modelo de Selecci{\'o}n de Portafolios R\&D para Casos de Grandes Carteras de Proyectos en el Sector Social},
author={Litvinchev, Igor and L{\'o}pez Irarragorri, Fernando and Mata P{\'e}rez, Miguel and Schaeffer, Elisa},
journal={Computaci{\'o}n y Sistemas},
volume={12},
number={2},
pages={163--172},
year={2008},
publisher={Centro de Investigaci{\'o}n en Computaci{\'o}n, IPN},
keywords = {pisis}
}Comparison of Lagrangian bounds for one class of generalized assignment problems. Litvinchev, I. S. & Rangel, S. Computational Mathematics and Mathematical Physics, 48(5):739--746, Springer, 2008.
bibtex
bibtex
@article{litvinchev2008comparison,
title={Comparison of Lagrangian bounds for one class of generalized assignment problems},
author={Litvinchev, Igor Semionovich and Rangel, Socorro},
journal={Computational Mathematics and Mathematical Physics},
volume={48},
number={5},
pages={739--746},
year={2008},
publisher={Springer},
keywords = {pisis}
}Structural identifiability in low-rank matrix factorization. Fritzilas, E., Rios-Solis, Y. A, & Rahmann, S. In Computing and Combinatorics, pages 140--148. Springer Berlin Heidelberg, 2008.
bibtex
bibtex
@incollection{fritzilas2008structural,
title={Structural identifiability in low-rank matrix factorization},
author={Fritzilas, Epameinondas and Rios-Solis, Yasmin A and Rahmann, Sven},
booktitle={Computing and Combinatorics},
pages={140--148},
year={2008},
publisher={Springer Berlin Heidelberg},
keywords = {pisis}
}An interactive algorithm for portfolio bi-criteria optimization of R&D projects in public organizations. Litvinchev, I & López, F Journal of Computer and Systems Sciences International, 47(1):25--32, Springer, 2008.
bibtex
bibtex
@article{litvinchev2008interactive,
title={An interactive algorithm for portfolio bi-criteria optimization of R\&D projects in public organizations},
author={Litvinchev, I and L{\'o}pez, F},
journal={Journal of Computer and Systems Sciences International},
volume={47},
number={1},
pages={25--32},
year={2008},
publisher={Springer},
keywords = {pisis}
}Scheduling with earliness--tardiness penalties and parallel machines. Rios-Solis, Y. A 4OR, 6(2):191--194, Springer-Verlag, 2008.
bibtex
bibtex
@article{rios2008scheduling,
title={Scheduling with earliness--tardiness penalties and parallel machines},
author={Rios-Solis, Yasmin A},
journal={4OR},
volume={6},
number={2},
pages={191--194},
year={2008},
publisher={Springer-Verlag},
keywords = {pisis}
}Exponential neighborhood search for a parallel machine scheduling problem. Rios-Solis, Y. A & Sourd, F. Computers & Operations Research, 35(5):1697--1712, Pergamon, 2008.
bibtex
bibtex
@article{rios2008exponential,
title={Exponential neighborhood search for a parallel machine scheduling problem},
author={Rios-Solis, Yasmin A and Sourd, Francis},
journal={Computers \& Operations Research},
volume={35},
number={5},
pages={1697--1712},
year={2008},
publisher={Pergamon},
keywords = {pisis}
}Operations Research and Systems (CLAIO XII). Allende, S., Osorio-Lama, M. A., Ríos-Mercado, R. Z., & Ruckmann, J., editors Volume 157 , Springer, Norwell, USA, 2008. Special issue of \textitAnnals of Operations Research
bibtex
bibtex
@book{ b:RZ-2008,
editor = {S. Allende and M. A. Osorio-Lama
and R. Z. Ríos-Mercado and J. Ruckmann},
title = {Operations Research and Systems (CLAIO XII)},
publisher = {Springer},
year = {2008},
volume = {157},
series = {},
address = {Norwell, USA},
edition = {},
month = {},
note = {Special issue of \textit{Annals of Operations Research}},
keywords = {pisis}
}2007 (3)
Refinement of Lagrangian bounds in optimization problems. Litvinchev, I. S. Computational Mathematics and Mathematical Physics, 47(7):1101--1107, Springer, 2007.
bibtex
bibtex
@article{litvinchev2007refinement,
title={Refinement of Lagrangian bounds in optimization problems},
author={Litvinchev, Igor Semionovich},
journal={Computational Mathematics and Mathematical Physics},
volume={47},
number={7},
pages={1101--1107},
year={2007},
publisher={Springer},
keywords = {pisis}
}When is R the union of an increasing family of null sets?. González-Hernández, J., Hernández-Hernández, F., & Villarreal, C. E Commentationes Mathematicae Universitatis Carolinae, 48(4):623--630, Universitas Carolina, 2007.
bibtex
bibtex
@article{gonzalez2007r,
title={When is R the union of an increasing family of null sets?},
author={Gonz{\'a}lez-Hern{\'a}ndez, Juan and Hern{\'a}ndez-Hern{\'a}ndez, Fernando and Villarreal, C{\'e}sar E},
journal={Commentationes Mathematicae Universitatis Carolinae},
volume={48},
number={4},
pages={623--630},
year={2007},
publisher={Universitas Carolina},
keywords = {pisis}
}Ordonnancement avance-retard sur machines parallèles. Solis, Y. A R. Ph.D. Thesis, 2007.
bibtex
bibtex
@phdthesis{solis2007ordonnancement,
title={Ordonnancement avance-retard sur machines parall{\`e}les},
author={Solis, Yasmin A Rios},
year={2007},
keywords = {pisis}
}2006 (4)
Técnicas Inteligentes para la Selección de Proyectos de I & D en las Grandes Organizaciones Públicas. Fernandez, E., Lopez, F., Navarro, J., & Duarte, A. Computación y Sistemas, 10(1):28--56, Centro de Investigación en Computación, IPN, 2006.
bibtex
bibtex
@article{fernandez2006tecnicas,
title={T{\'e}cnicas Inteligentes para la Selecci{\'o}n de Proyectos de I \& D en las Grandes Organizaciones P{\'u}blicas},
author={Fernandez, Eduardo and Lopez, Fernando and Navarro, Jorge and Duarte, Alfonso},
journal={Computaci{\'o}n y Sistemas},
volume={10},
number={1},
pages={28--56},
year={2006},
publisher={Centro de Investigaci{\'o}n en Computaci{\'o}n, IPN},
keywords = {pisis}
}Using error bounds to compare aggregated generalized transportation models. Litvinchev, I. S & Rangel, S. Annals of Operations Research, 146(1):119--134, Springer US, 2006.
bibtex
bibtex
@article{litvinchev2006using,
title={Using error bounds to compare aggregated generalized transportation models},
author={Litvinchev, Igor S and Rangel, Socorro},
journal={Annals of Operations Research},
volume={146},
number={1},
pages={119--134},
year={2006},
publisher={Springer US},
keywords = {pisis}
}Greedy Randomized Adaptive Search Procedures. Angel-Bello, F. R, González-Velarde, J. L., & Alvarez, A. M In Metaheuristic Procedures for Training Neutral Networks, pages 207--223. Springer US, 2006.
bibtex
bibtex
@incollection{angel2006greedy,
title={Greedy Randomized Adaptive Search Procedures},
author={Angel-Bello, Francisco R and Gonz{\'a}lez-Velarde, Jos{\'e} Luis and Alvarez, Ada M},
booktitle={Metaheuristic Procedures for Training Neutral Networks},
pages={207--223},
year={2006},
publisher={Springer US},
keywords = {pisis}
}INTELLIGENT TECHNIQUES FOR R&D PROJECT SELECTION IN LARGE SOCIAL ORGANIZATIONS Computación y Sistemas, julio-septiembre, año/vol. 10, número 001 Instituto Politécnico Nacional Distrito Federal, México. Fernandez, E., Lopez, F., Navarro, J., & Duarte, A. Computación y Sistemas, 10(1):28--56, 2006.
bibtex
bibtex
@article{fernandez2006intelligent,
title={INTELLIGENT TECHNIQUES FOR R\&D PROJECT SELECTION IN LARGE SOCIAL ORGANIZATIONS Computaci{\'o}n y Sistemas, julio-septiembre, a{\~n}o/vol. 10, n{\'u}mero 001 Instituto Polit{\'e}cnico Nacional Distrito Federal, M{\'e}xico},
author={Fernandez, Eduardo and Lopez, Fernando and Navarro, Jorge and Duarte, Alfonso},
journal={Computaci{\'o}n y Sistemas},
volume={10},
number={1},
pages={28--56},
year={2006},
keywords = {pisis}
}2005 (5)
A nonmeasurable set as a union of a family of increasing well ordered measurable sets. González-Hernández, J. & Villarreal, C. E Morfismos, 9(1):35--38, Publicaciones del Departamento de Matemáticas del CINVESTAV, 2005.
bibtex
bibtex
@article{gonzalez2005nonmeasurable,
title={A nonmeasurable set as a union of a family of increasing well ordered measurable sets},
author={Gonz{\'a}lez-Hern{\'a}ndez, Juan and Villarreal, C{\'e}sar E},
journal={Morfismos},
volume={9},
number={1},
pages={35--38},
year={2005},
publisher={Publicaciones del Departamento de Matemáticas del CINVESTAV},
keywords = {pisis}
}Pre-processing a Network Design Problem using GRASP. Perez, F, Alvarez, A, & de Alba, K WSEAS TRANSACTIONS ON MATHEMATICS, 4(2):95, WSEAS Press, 2005.
bibtex
bibtex
@article{perez2005pre,
title={Pre-processing a Network Design Problem using GRASP},
author={Perez, F and Alvarez, A and de Alba, K},
journal={WSEAS TRANSACTIONS ON MATHEMATICS},
volume={4},
number={2},
pages={95},
year={2005},
publisher={WSEAS Press},
keywords = {pisis}
}A constructive procedure for finding good starting solutions to the network design problem with uncertain parameters. Pérez, F., ALVAREZ, A., & De Alba, K. In Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science, pages 44, 2005. World Scientific and Engineering Academy and Society (WSEAS).
bibtex
bibtex
@inproceedings{perez2005constructive,
title={A constructive procedure for finding good starting solutions to the network design problem with uncertain parameters},
author={P{\'e}rez, Fernando and ALVAREZ, ADAM and De Alba, Karim},
booktitle={Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science},
pages={44},
year={2005},
organization={World Scientific and Engineering Academy and Society (WSEAS)},
keywords = {pisis}
}GRASP embedded scatter search for the multicommodity capacitated network design problem. Alvarez, A. M, González-Velarde, J. L., & De-Alba, K. Journal of Heuristics, 11(3):233--257, Kluwer Academic Publishers, 2005.
bibtex
bibtex
@article{alvarez2005grasp,
title={GRASP embedded scatter search for the multicommodity capacitated network design problem},
author={Alvarez, Ada M and Gonz{\'a}lez-Velarde, Jos{\'e} Luis and De-Alba, Karim},
journal={Journal of Heuristics},
volume={11},
number={3},
pages={233--257},
year={2005},
publisher={Kluwer Academic Publishers},
keywords = {pisis}
}Scatter search for network design problem. Alvarez, A. M, González-Velarde, J. L., & De-Alba, K. Annals of Operations Research, 138(1):159--178, Kluwer Academic Publishers, 2005.
bibtex
bibtex
@article{alvarez2005scatter,
title={Scatter search for network design problem},
author={Alvarez, Ada M and Gonz{\'a}lez-Velarde, Jos{\'e} Luis and De-Alba, Karim},
journal={Annals of Operations Research},
volume={138},
number={1},
pages={159--178},
year={2005},
publisher={Kluwer Academic Publishers},
keywords = {pisis}
}2004 (2)
Minimización Heurística del Número de Tareas Tardías al Secuenciar Líneas de Flujo. Salazar Aguilar, M. A. & Ríos Mercado, R. Z. Ingenierías, 7(23):52--57, 2004.
bibtex
bibtex
@ARTICLE{a:inge-2004,
AUTHOR = "M. A. {Salazar Aguilar} and R. Z. {R\'{\i}os Mercado}",
TITLE = "Minimizaci\'on Heur\'{\i}stica del N\'umero de
Tareas Tard\'{\i}as al Secuenciar L\'{\i}neas de Flujo",
JOURNAL = "Ingenier\'{\i}as",
YEAR = "2004",
volume = "7",
number = "23",
pages = "52--57",
keywords = "pisis" }
%--------------------------------------------------------
% Conference Proceedings Papers
%--------------------------------------------------------A heuristic to find a p%-robust network design. Alvarez, A. M, Medina, A., & De Alba, K. WSEAS Transactions on Circuits and Systems, 3(10):2247--2253, 2004.
bibtex
bibtex
@article{alvarez2004heuristic,
title={A heuristic to find a p\%-robust network design.},
author={Alvarez, Ada M and Medina, Augusto and De Alba, Karem},
journal={WSEAS Transactions on Circuits and Systems},
volume={3},
number={10},
pages={2247--2253},
year={2004},
keywords = {pisis}
}2003 (2)
GRASP with adaptive memory programming for finding good starting solutions to the multicommodity capacitated network design problem. De Alba, K., Álvarez, A., & Gonzalez-Velarde, J. L. In Computational Modeling and Problem Solving in the Networked World, pages 121--137. Springer US, 2003.
bibtex
bibtex
@incollection{de2003grasp,
title={GRASP with adaptive memory programming for finding good starting solutions to the multicommodity capacitated network design problem},
author={De Alba, Karim and {\'A}lvarez, Ada and Gonzalez-Velarde, Jose Luis},
booktitle={Computational Modeling and Problem Solving in the Networked World},
pages={121--137},
year={2003},
publisher={Springer US},
keywords = {pisis}
}A circular cone relaxation primal interior point algorithm for LP. Litvinchev, I. S Optimization, 52(4-5):529--540, Taylor & Francis, 2003.
bibtex
bibtex
@article{litvinchev2003circular,
title={A circular cone relaxation primal interior point algorithm for LP},
author={Litvinchev, Igor S},
journal={Optimization},
volume={52},
number={4-5},
pages={529--540},
year={2003},
publisher={Taylor \& Francis},
keywords = {pisis}
}2002 (1)
Using circular cone relaxations in interior point algorithms. Litvinchev*, I. Technical Report Graduate Program in Systems Engineering, UANL, San Nicolás de los Garza, México, November, 2002. PISIS-2002-02.
Paper bibtex
Paper bibtex @TechReport{pisisTR-2002-2,
author = {I. Litvinchev*},
title = {Using circular cone relaxations in interior point algorithms},
institution = {Graduate Program in Systems Engineering, UANL},
year = {2002},
address = {San Nicolás de los Garza, México},
url = {https://googledrive.com/host/0B92aE0wdpf7TdnVHSTJaMWgxYTg/2002/pisis-2002-02.pdf},
month = {November},
note = {PISIS-2002-02.}
}2001 (2)
A priori error bounds for the aggregation in the generalized transportation problem. Litvinchev, I. S, Rangel, S., & Chacon, O. Journal of Computer and Systems Sciences International, 40(6):923--929, Springer, 2001.
bibtex
bibtex
@article{litvinchev2001priori,
title={A priori error bounds for the aggregation in the generalized transportation problem},
author={Litvinchev, Igor S and Rangel, Socorro and Chacon, Oscar},
journal={Journal of Computer and Systems Sciences International},
volume={40},
number={6},
pages={923--929},
year={2001},
publisher={Springer},
keywords = {pisis}
}Scatter search for the multicommodity capacited network design problem. Alvarez, A, González-Velarde, J., & De Alba, K Proceedings of 6th Annual International Conference on Industrial Engineering—Theory, Aplications and Practice, 2001.
bibtex
bibtex
@article{alvarez2001scatter,
title={Scatter search for the multicommodity capacited network design problem},
author={Alvarez, A and Gonz{\'a}lez-Velarde, JL and De Alba, K},
journal={Proceedings of 6th Annual International Conference on Industrial Engineering—Theory, Aplications and Practice},
year={2001},
keywords = {pisis}
}2000 (5)
Error bounds for the aggregation in the generalized transportation problem. Litvinchev, I. S, Rangel, S., & Andrade, I Proceedings of the 3rd Moscow International Conference on Operations Research, 2000.
bibtex
bibtex
@article{litvinchev2000error,
title={Error bounds for the aggregation in the generalized transportation problem},
author={Litvinchev, Igor S and Rangel, Socorro and Andrade, I},
journal={Proceedings of the 3rd Moscow International Conference on Operations Research},
pages={69--70},
year={2000},
keywords = {pisis}
}Ellipsoids containing optimal solutions of the linear programming problem. Litvinchev, I. S. Computational mathematics and mathematical physics, 40(2):178--188, Springer, 2000.
bibtex
bibtex
@article{litvinchev2000ellipsoids,
title={Ellipsoids containing optimal solutions of the linear programming problem},
author={Litvinchev, Igor Semionovich},
journal={Computational mathematics and mathematical physics},
volume={40},
number={2},
pages={178--188},
year={2000},
publisher={Springer},
keywords = {pisis}
}On improved Choi--Goldfarb solution-containing ellipsoids in linear programming. Litvinchev, I. S Operations Research Letters, 27(1):29--37, North-Holland, 2000.
bibtex
bibtex
@article{litvinchev2000improved,
title={On improved Choi--Goldfarb solution-containing ellipsoids in linear programming},
author={Litvinchev, Igor S},
journal={Operations Research Letters},
volume={27},
number={1},
pages={29--37},
year={2000},
publisher={North-Holland},
keywords = {pisis}
}Preprocessing on natural gas transmission networks. Ríos-Mercado*, R. Z., Wu, S., Scott, L. R., & Boyd, E. A. Technical Report Graduate Program in Systems Engineering, UANL, San Nicolás de los Garza, México, November, 2000. PISIS-2000-01.
Paper bibtex 4 downloads
Paper bibtex 4 downloads @TechReport{pisisTR-2000-1,
author = {R. Z. Ríos-Mercado* and S. Wu and L. R. Scott and E. A. Boyd},
title = {Preprocessing on natural gas transmission networks},
institution = {Graduate Program in Systems Engineering, UANL},
year = {2000},
address = {San Nicolás de los Garza, México},
url = {https://googledrive.com/host/0B92aE0wdpf7TdnVHSTJaMWgxYTg/2000/pisis-2000-01.pdf},
month = {November},
note = {PISIS-2000-01.}
}Heuristics for Minimum Cost Steady-State Gas Transmission Networks. Kim, S., Ríos-Mercado, R. Z., & Boyd, E. A. In Laguna, M. & Gonźalez-Velarde, J. L., editors, Computing Tools for Modeling, Optimization, and Simulation, 11, pages 203--213. Kluwer, Boston, 2000.
bibtex
bibtex
@incollection{ ch:KimRZBoy-2000,
author = {S. Kim and R. Z. Ríos-Mercado and E. A. Boyd},
title = {Heuristics for Minimum Cost Steady-State Gas
Transmission Networks},
booktitle = {Computing Tools for Modeling, Optimization, and
Simulation},
publisher = {Kluwer},
year = {2000},
editor = {M. Laguna and J. L. Gonźalez-Velarde},
chapter = {11},
pages = {203--213},
address = {Boston},
keywords = {pisis}
}1999 (3)
Use of memetic algorithms to solve a stochastic location model: health resources for diabetics in some provinces of Castilla-León. Alegre, J. F, Avarez, A, Casado, S., & Pacheco, J. A Rect, 1999.
bibtex
bibtex
@book{alegre1999use,
title={Use of memetic algorithms to solve a stochastic location model: health resources for diabetics in some provinces of Castilla-Le{\'o}n},
author={Alegre, Jes{\'u}s F and Avarez, A and Casado, Silvia and Pacheco, Joaqu{\'\i}n A},
year={1999},
publisher={Rect},
keywords = {pisis}
}Aggregation-Based Decomposition for Multi-Divisional Models. Litvinchev, I., Silva, G., & Treskov, Y. P JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL C/C OF TEKHNICHESKAIA KIBERNETIKA, 38:244--254, WILEY, 1999.
bibtex
bibtex
@article{litvinchev1999aggregation,
title={Aggregation-Based Decomposition for Multi-Divisional Models},
author={Litvinchev, IS and Silva, GN and Treskov, Yu P},
journal={JOURNAL OF COMPUTER AND SYSTEMS SCIENCES INTERNATIONAL C/C OF TEKHNICHESKAIA KIBERNETIKA},
volume={38},
pages={244--254},
year={1999},
publisher={WILEY},
keywords = {pisis}
}Localization of the optimal solution and a posteriori bounds for aggregation. Litvinchev, I. S & Rangel, S. Computers & operations research, 26(10):967--988, Pergamon, 1999.
bibtex
bibtex
@article{litvinchev1999localization,
title={Localization of the optimal solution and a posteriori bounds for aggregation},
author={Litvinchev, Igor S and Rangel, Socorro},
journal={Computers \& operations research},
volume={26},
number={10},
pages={967--988},
year={1999},
publisher={Pergamon},
keywords = {pisis}
}1998 (3)
Ergodic decomposition of Markov chains. Villarreal, C. E Linear algebra and its applications, 283(1):61--73, North-Holland, 1998.
bibtex
bibtex
@article{villarreal1998ergodic1,
title={Ergodic decomposition of Markov chains},
author={Villarreal, C{\'e}sar E},
journal={Linear algebra and its applications},
volume={283},
number={1},
pages={61--73},
year={1998},
publisher={North-Holland},
keywords = {pisis}
}Ergodic decomposition of Markov operators on signed measures. Villarreal, C. E Morfismos, 2(1):39--45, Publicaciones del Departamento de Matemáticas del CINVESTAV, 1998.
bibtex
bibtex
@article{villarreal1998ergodic2,
title={Ergodic decomposition of Markov operators on signed measures},
author={Villarreal, C{\'e}sar E},
journal={Morfismos},
volume={2},
number={1},
pages={39--45},
year={1998},
publisher={Publicaciones del Departamento de Matemáticas del CINVESTAV},
keywords = {pisis}
}Integer Programming and Combinatorial Optimization. Bixby, R. E., Boyd, E. A., & Ríos-Mercado, R. Z., editors Volume 1412 of Lecture Notes in Computer Science, Springer, Berlin, 1998.
Paper bibtex
Paper bibtex @book{ b:RZ-1998,
editor = {R. E. Bixby and E. A. Boyd and R. Z. Ríos-Mercado},
title = {Integer Programming and Combinatorial Optimization},
publisher = {Springer},
year = {1998},
volume = {1412},
series = {Lecture Notes in Computer Science},
address = {Berlin},
edition = {},
month = {},
note = {},
url = {http://link.springer.de/link/service/series/0558/tocs/t1412.htm},
keywords = {pisis}
}1994 (1)
The use of lower bounds in minimizaton by the interior-point method. Litvinchev, I. S. Computational mathematics and mathematical physics, 34(7):843--847, Springer, 1994.
bibtex
bibtex
@article{litvinchev1994use,
title={The use of lower bounds in minimizaton by the interior-point method},
author={Litvinchev, Igor Semionovich},
journal={Computational mathematics and mathematical physics},
volume={34},
number={7},
pages={843--847},
year={1994},
publisher={Springer},
keywords = {pisis}
}1993 (1)
Bounds on the suboptimalization of aggregation in convex programming. Litvinchev, I. S. Computational Mathematics and Mathematical Physics, 33(8):1007--1015, Springer, 1993.
bibtex
bibtex
@article{litvinchev1993bounds,
title={Bounds on the suboptimalization of aggregation in convex programming},
author={Litvinchev, Igor Semionovich},
journal={Computational Mathematics and Mathematical Physics},
volume={33},
number={8},
pages={1007--1015},
year={1993},
publisher={Springer},
keywords = {pisis}
}1992 (1)
Iterative aggregation and decomposition in block-separable extremum problems. Litvinchev, I. S. Computational Mathematics and Mathematicas Physics, 32(8):1179--1181, Springer, 1992.
bibtex
bibtex
@article{litvinchev1992iterative,
title={Iterative aggregation and decomposition in block-separable extremum problems},
author={Litvinchev, Igor Semionovich},
journal={Computational Mathematics and Mathematicas Physics},
volume={32},
number={8},
pages={1179--1181},
year={1992},
publisher={Springer},
keywords = {pisis}
}1991 (1)
Large-scale interconnected control problems. Part 2. Iterative decomposition techniques. Litvinchev, I. S. & Tsurkov, V. Matematicheskoe Modelirovanie, 3(1):79--95, Russian Academy of Sciences, Branch of Mathematical Sciences, 1991.
bibtex
bibtex
@article{litvinchev1991large,
title={Large-scale interconnected control problems. Part 2. Iterative decomposition techniques},
author={Litvinchev, Igor Semionovich and Tsurkov, VI},
journal={Matematicheskoe Modelirovanie},
volume={3},
number={1},
pages={79--95},
year={1991},
publisher={Russian Academy of Sciences, Branch of Mathematical Sciences},
keywords = {pisis}
}1990 (2)
DECOMPOSITION IN CONTROL OF SYSTEMS OF THE HYPERBOLIC TYPE WITH CROSSED CONNECTIONS. Litvinchev, I. SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES, 28(3):74--81, Springer, 1990.
bibtex
bibtex
@article{litvinchev1990decomposition,
title={DECOMPOSITION IN CONTROL OF SYSTEMS OF THE HYPERBOLIC TYPE WITH CROSSED CONNECTIONS},
author={Litvinchev, IS},
journal={SOVIET JOURNAL OF COMPUTER AND SYSTEMS SCIENCES},
volume={28},
number={3},
pages={74--81},
year={1990},
publisher={Springer},
keywords = {pisis}
}Optimal control dynamic models with cross connection. Litvinchev, I. S. & Tsurkov, V. Matematicheskoe Modelirovanie, 2(12):3--16, Russian Academy of Sciences, Branch of Mathematical Sciences, 1990.
bibtex
bibtex
@article{litvinchev1990optimal,
title={Optimal control dynamic models with cross connection},
author={Litvinchev, Igor Semionovich and Tsurkov, VI},
journal={Matematicheskoe Modelirovanie},
volume={2},
number={12},
pages={3--16},
year={1990},
publisher={Russian Academy of Sciences, Branch of Mathematical Sciences},
keywords = {pisis}
}1989 (2)
An investigation of multi-dimensional control problems for heat conduction. Litvinchev, I. S. Matematicheskoe Modelirovanie, 1(11):25--33, Russian Academy of Sciences, Branch of Mathematical Sciences, 1989.
bibtex
bibtex
@article{litvinchev1989investigation,
title={An investigation of multi-dimensional control problems for heat conduction},
author={Litvinchev, Igor Semionovich},
journal={Matematicheskoe Modelirovanie},
volume={1},
number={11},
pages={25--33},
year={1989},
publisher={Russian Academy of Sciences, Branch of Mathematical Sciences},
keywords = {pisis}
}ITERATIVE DECOMPOSITION IN INTERCONNECTED DYNAMIC-SYSTEMS. LITVINCHEV, I. DOKLADY AKADEMII NAUK SSSR, 306(5):1046--1048, MEZHDUNARODNAYA KNIGA 39 DIMITROVA UL., 113095 MOSCOW, RUSSIA, 1989.
bibtex
bibtex
@article{litvinchev1989iterative,
title={ITERATIVE DECOMPOSITION IN INTERCONNECTED DYNAMIC-SYSTEMS},
author={LITVINCHEV, IS},
journal={DOKLADY AKADEMII NAUK SSSR},
volume={306},
number={5},
pages={1046--1048},
year={1989},
publisher={MEZHDUNARODNAYA KNIGA 39 DIMITROVA UL., 113095 MOSCOW, RUSSIA},
keywords = {pisis}
}1987 (1)
Method of Expansion for Optimization Problems which do not have a Block-Separable Structure. Litvinchev, I. S. Computational Mathematics and Mathematical Physics, 27(2):6--11, Elsevier, 1987.
bibtex
bibtex
@article{litvinchev1987method,
title={Method of Expansion for Optimization Problems which do not have a Block-Separable Structure},
author={Litvinchev, Igor Semionovich},
journal={Computational Mathematics and Mathematical Physics},
volume={27},
number={2},
pages={6--11},
year={1987},
publisher={Elsevier},
keywords = {pisis}
}undefined (7)
Modelo para Problemas de Cooperación en Proyectos de Desarrollo con Alto Riesgo. ESPIN ANDRADE, R., FERNÁNDEZ GONZÁLEZ, E., LÓPEZ, F., & DELGADO, M. Computación y Sistemas.
bibtex
bibtex
@article{espinmodelo,
title={Modelo para Problemas de Cooperaci{\'o}n en Proyectos de Desarrollo con Alto Riesgo},
author={ESPIN ANDRADE, RAFAEL and FERN{\'A}NDEZ GONZ{\'A}LEZ, EDUARDO and L{\'O}PEZ, FERNANDO and DELGADO, MERCEDES},
publisher={Computaci{\'o}n y Sistemas},
keywords = {pisis}
}Optimizing the Urban Public Transport in the City of Burgos. Álvarez, A., Casado, S., González-Velarde, J. L., & Pacheco, J.
bibtex
bibtex
@article{alvarezoptimizing,
title={Optimizing the Urban Public Transport in the City of Burgos},
author={{\'A}lvarez, Ada and Casado, Silvia and Gonz{\'a}lez-Velarde, Jos{\'e} Luis and Pacheco, Joaqu{\'\i}n},
keywords = {pisis}
}Diseño de Cadena de Suministro con Incertidumbre en los Parámetros. Santoyo, J. M. & Álvarez, A. M
bibtex
bibtex
@article{santoyodiseno,
title={Dise{\~n}o de Cadena de Suministro con Incertidumbre en los Par{\'a}metros},
author={Santoyo, Jos{\'e} Manuel and {\'A}lvarez, Ada M},
keywords = {pisis}
}Sistema de Apoyo Inteligente para la Selección de Proyectos de I&D en las Grandes Organizaciones Públicas. Navarro, J., Fernández, E., López, F., & Duarte, A.
bibtex
bibtex
@article{navarrosistema,
title={Sistema de Apoyo Inteligente para la Selecci{\'o}n de Proyectos de I\&D en las Grandes Organizaciones P{\'u}blicas},
author={Navarro, Jorge and Fern{\'a}ndez, Eduardo and L{\'o}pez, Fernando and Duarte, Alfonso},
keywords = {pisis}
}Multi-criteria classification applied to characterize skeletal maturation in male and female from 9 to 16 years with normal occlusion. López, F., Llanes, L. M. P., & Morales, R. G.
bibtex
bibtex
@article{lopezmulti,
title={Multi-criteria classification applied to characterize skeletal maturation in male and female from 9 to 16 years with normal occlusion.},
author={L{\'o}pez, Fernando and Llanes, Luis Miguel Prado and Morales, Rodolfo Garza},
keywords = {pisis}
}BÚSQUEDA TABÚ PARA UN PROBLEMA DE DISEÑO DE RED MULTIPRODUCTO CON CAPACIDAD FINITA EN LAS ARISTAS. ZALETA, I. N. C. & DE MAESTRO, E. O. A. G.
bibtex
bibtex
@article{zaletabusqueda,
title={B{\'U}SQUEDA TAB{\'U} PARA UN PROBLEMA DE DISE{\~N}O DE RED MULTIPRODUCTO CON CAPACIDAD FINITA EN LAS ARISTAS},
author={ZALETA, ING NADIA COBOS and DE MAESTRO, EN OPCI{\'O}N AL GRADO},
keywords = {pisis}
}A Location-Allocation Heuristic for a Territory Design Problem in a Beverage Distribution Firm. 12. J. A. Segura-Ramiro, R. Z. R. & A. M, K. d. A. R.
bibtex
bibtex
@article{12location,
title={A Location-Allocation Heuristic for a Territory Design Problem in a Beverage Distribution Firm},
author={12. J. A. Segura-Ramiro, R. Z. R{\'\i}os-Mercado, A. M, K. de Alba Romenus},
keywords = {pisis}
}