Navegar

Colección

Datos Estadísticas

Lista de

Linear programming
18
"Improving access to voting with optimized matchings" (2018) Durán, G.;Giormenti, M.;Guajardo, M. (...)Stier-Moses, N.E. Electoral Studies. 51:38-48
"Selecting working teams for information technology outsourcing projects through a combination of methodologies" (2017) Castellini, M.A.; Zanazzi, J.L.; Cabrera, G.P. Pesquisa Operacional. 37(1):67-92
"A branch-and-price algorithm for the (k,c)-coloring problem" (2015) Malaguti, E.; Méndez-Díaz, I.; José Miranda-Bront, J.; Zabala, P. Networks. 65(4):353-366
"Facets and valid inequalities for the time-dependent travelling salesman problem" (2014) Miranda-Bront, J.J.; Méndez-Díaz, I.; Zabala, P. European Journal of Operational Research. 236(3):891-902
"Mathematical models for optimizing production chain planning in salmon farming" (2013) Bravo, F.;Durán, G.;Lucena, A. (...)Weintraub, A. International Transactions in Operational Research. 20(5):731-766
"A linear programming approach for adaptive synchronization of traffic signals" (2013) Coll, P.; Factorovich, P.; Loiseau, I.; Gómez, R. International Transactions in Operational Research. 20(5):667-679
"A linear programming approach for adaptive synchronization of traffic signals" (2013) Coll, P.; Factorovich, P.; Loiseau, I.; Gómez, R. International Transactions in Operational Research. 20(5):667-679
"A polyhedral study of the maximum edge subgraph problem" (2012) Bonomo, F.; Marenco, J.; Saban, D.; Stier-Moses, N.E. Discrete Applied Mathematics. 160(18):2573-2590
"Fast action detection via discriminative random forest voting and top-K subvolume search" (2011) Yu, G.; Goussies, N.A.; Yuan, J.; Liu, Z. IEEE Transactions on Multimedia. 13(3):507-517
"Some lower bounds for the complexity of the linear programming feasibility problem over the reals" (2009) Grimson, R.; Kuijpers, B. Journal of Complexity. 25(1):25-37
"Some lower bounds for the complexity of the linear programming feasibility problem over the reals" (2009) Grimson, R.; Kuijpers, B. Journal of Complexity. 25(1):25-37
"A new formulation for the Traveling Deliveryman Problem" (2008) Méndez-Díaz, I.; Zabala, P.; Lucena, A. Discrete Applied Mathematics. 156(17):3223-3237
"Proper Helly circular-arc graphs" (2007) Lin, M.C.; Soulignac, F.J.; Szwarcfiter, J.L. 33rd International Conference Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007. 4769 LNCS:248-257
"Column-generation in integer linear programming" (2003) Maculan, N.; De Mendonça Passini, M.; De Moura Brito, J.A.; Loiseau, I. RAIRO - Operations Research. 37(2):67-83
"On clique-transversals and clique-independent sets" (2002) Durán, G.; Lin, M.C.; Szwarcfiter, J.L. Annals of Operations Research. 116(1-4):71-77
"On checking timed automata for linear duration invariants" (1998) Braberman, Victor Adrian; Van Hung, Dang Proceedings of the 1998 19th IEEE Real-Time Systems Symposium:264-273