Výsledky vyhledávání - "Analysis of algorithms: computational complexity"

Parametric Integer Programming in Fixed Dimension

Autoři: Eisenbrand, Friedrich Shmonin, Gennady

Zdroj: Mathematics of Operations Research, 2008 Nov 01. 33(4), 839-850.

Přístupová URL adresa: https://www.jstor.org/stable/25578091

Integer Polynomial Optimization in Fixed Dimension

Autoři: De Loera, Jesús A. Hemmecke, Raymond Köppe, Matthias a další

Zdroj: Mathematics of Operations Research, 2006 Feb 01. 31(1), 147-153.

Přístupová URL adresa: https://www.jstor.org/stable/25151712

Tutorial on Computational Complexity

Autoři: Tovey, Craig A.

Zdroj: Interfaces, 2002 May 01. 32(3), 30-61.

Přístupová URL adresa: https://www.jstor.org/stable/25062816

Maximum Commonality Problems: Applications and Analysis

Autoři: Milind Dawande Subodha Kumar Vijay Mookerjee a další

Zdroj: Management Science. 54:194-207

Témata: 0211 other engineering and technologies, 0102 computer and information sciences, 02 engineering and technology, 01 natural sciences, analysis of algorithms, computational complexity, integer programming, applications, suboptimal algorithms

Přístupová URL adresa: https://www.jstor.org/stable/20122370
https://econpapers.repec.org/article/inmormnsc/v_3a54_3ay_3a2008_3ai_3a1_3ap_3a194-207.htm
https://www.mgmt.purdue.edu/academics/mis/workshop/papers/vsm_103009_2.pdf
https://www.krannert.purdue.edu/academics/MIS/workshop/papers/vsm_103009_2.pdf
https://ideas.repec.org/a/inm/ormnsc/v54y2008i1p194-207.html
https://pubsonline.informs.org/doi/abs/10.1287/mnsc.1070.0766

A column generation algorithm for choice-based network revenue management

Autoři: Bront, J.J.M. Méndez-Díaz, I. Vulcano, G.

Témata: Analysis of algorithms: computational complexity, Linear applications, Marketing: choice models, Programming: fractional, Columbia University, Column generation, Computational challenges, Computational results, Customer choice, Exact algorithms, Flexible products, General version, Greedy heuristics, High quality, Linear programming models, Manufacturing service, Multinomials, New York, NP-hard, Phillips, Practical solutions, Real-size networks, Revenue management, Algorithms, Computational complexity, Customer satisfaction, Dynamic programming, Heuristic algorithms, Heuristic methods, Linearization

Relation: https://hdl.handle.net/20.500.12110/paper_0030364X_v57_n3_p769_Bront

Dostupnost: https://hdl.handle.net/20.500.12110/paper_0030364X_v57_n3_p769_Bront

A column generation algorithm for choice-based network revenue management

Autoři: Méndez Díaz, Isabel Vulcano, Gustavo José

Témata: Analysis of algorithms: computational complexity, Linear applications, Marketing: choice models, Programming: fractional, Columbia University, Column generation, Computational challenges, Computational results, Customer choice, Exact algorithms, Flexible products, General version, Greedy heuristics, High quality, Linear programming models, Manufacturing service, Multinomials, New York, NP-hard, Phillips, Practical solutions, Real-size networks, Revenue management, Algorithms, Computational complexity, Customer satisfaction, Dynamic programming, Heuristic algorithms, Heuristic methods, Linearization

Relation: https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0030364X_v57_n3_p769_Bront; https://hdl.handle.net/20.500.12110/paper_0030364X_v57_n3_p769_Bront

Dostupnost: https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_0030364X_v57_n3_p769_Bront
https://hdl.handle.net/20.500.12110/paper_0030364X_v57_n3_p769_Bront