Suchergebnisse - "analysis of algorithms: computational complexity"

Parametric Integer Programming in Fixed Dimension

Autoren: Eisenbrand, Friedrich Shmonin, Gennady

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

Zugangs-URL: https://www.jstor.org/stable/25578091

Integer Polynomial Optimization in Fixed Dimension

Autoren: De Loera, Jesús A. Hemmecke, Raymond Köppe, Matthias et al.

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

Zugangs-URL: https://www.jstor.org/stable/25151712

Tutorial on Computational Complexity

Autoren: Tovey, Craig A.

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

Zugangs-URL: https://www.jstor.org/stable/25062816

Maximum Commonality Problems: Applications and Analysis

Autoren: Milind Dawande Subodha Kumar Vijay Mookerjee et al.

Quelle: Management Science. 54:194-207

Schlagwörter: 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

Zugangs-URL: 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

Automation of Strategic Data Prioritization in System Model Calibration: Sensor Placement.

Autoren: Li, Tianyi Dahleh, Munther A.

Quelle: INFORMS Journal on Computing. Jan/Feb2024, Vol. 36 Issue 1, p163-184. 22p.

Schlagwörter: *DATA libraries, SENSOR placement, SIMULATED annealing, DYNAMICAL systems, COMBINATORIAL optimization, ACQUISITION of data, CALIBRATION

Online Mixed-Integer Optimization in Milliseconds.

Autoren: Bertsimas, Dimitris Stellato, Bartolomeo

Quelle: INFORMS Journal on Computing. Jul/Aug2022, Vol. 34 Issue 4, p2229-2248. 20p.

Schlagwörter: *FEEDFORWARD neural networks, *MATRIX decomposition, *ONLINE algorithms, *MACHINE learning, *ENERGY management, *LINEAR systems

Deals or No Deals: Contract Design for Online Advertising.

Autoren: Kim, Anthony Mirrokni, Vahab Nazerzadeh, Hamid

Quelle: Operations Research. Sep/Oct2021, Vol. 69 Issue 5, p1450-1467. 18p. 2 Diagrams, 3 Charts, 1 Graph.

Schlagwörter: *INTERNET advertising, *CONTRACTS, *ELECTRONIC commerce, *ADVERTISERS, APPROXIMATION algorithms, NP-hard problems

Fast Algorithms for Rank-1 Bimatrix Games.

Autoren: Adsul, Bharat Garg, Jugal Mehta, Ruta et al.

Quelle: Operations Research. Mar/Apr2021, Vol. 69 Issue 2, p613-631. 19p. 3 Diagrams, 1 Chart, 1 Graph.

Schlagwörter: *NASH equilibrium, *DEALERS (Retail trade), *ALGORITHMS, POLYNOMIAL time algorithms, COMPUTATIONAL complexity, GAMES

Why Is Maximum Clique Often Easy in Practice?

Autoren: Walteros, Jose L. Buchanan, Austin

Quelle: Operations Research. Nov/Dec2020, Vol. 68 Issue 6, p1866-1895. 30p. 3 Diagrams, 10 Charts, 3 Graphs.

Schlagwörter: *ALGORITHMS, POLYNOMIAL time algorithms

Geografische Kategorien: AUSTIN (Tex.)

Sustainability Planning for Healthcare Information Exchanges with Supplier Rebate Program.

Autoren: Rajapakshe, Tharanga Kumar, Subodha Sen, Arun et al.

Quelle: Operations Research. May/Jun2020, Vol. 68 Issue 3, p793-817. 25p.

Schlagwörter: *INFORMATION sharing, *REBATES, *MEDICAL personnel, *SUPPLIERS, SUSTAINABILITY

Geografische Kategorien: AUSTIN (Tex.), TEXAS

Multiechelon Lot Sizing: New Complexities and Inequalities.

Autoren: Zhao, Ming Zhang, Minjiao

Quelle: Operations Research. Mar/Apr2020, Vol. 68 Issue 2, p534-551. 18p. 6 Illustrations, 1 Diagram, 7 Charts.

Schlagwörter: *PRODUCTION planning, *INDUSTRIAL capacity, POLYNOMIAL time algorithms, COST functions, MATHEMATICAL equivalence

Closing the Gap for Makespan Scheduling via Sparsification Techniques.

Autoren: Jansen, Klaus Klein, Kim-Manuel Verschae, José

Quelle: Mathematics of Operations Research. Nov2020, Vol. 45 Issue 4, p1371-1392. 22p.

Schlagwörter: *PRODUCTION scheduling, *ALGORITHMS, *INTEGER programming, *SCHEDULING, POLYNOMIAL approximation

Randomized Linear Programming Solves the Markov Decision Problem in Nearly Linear (Sometimes Sublinear) Time.

Autoren: Wang, Mengdi¹ (AUTHOR)

Quelle: Mathematics of Operations Research. May2020, Vol. 45 Issue 2, p517-546. 30p.

Schlagwörter: *MARKOV processes, *LINEAR programming

Primal–Dual Interior-Point Methods for Domain-Driven Formulations.

Autoren: Karimi, Mehdi Tunçel, Levent

Quelle: Mathematics of Operations Research. May2020, Vol. 45 Issue 2, p591-621. 31p.

Schlagwörter: *LINEAR programming, *APPLICATION software, *NONLINEAR programming, INTERIOR-point methods, DUALITY theory (Mathematics)

On the Efficiency of Random Permutation for ADMM and Coordinate Descent.

Autoren: Sun, Ruoyu Luo, Zhi-Quan Ye, Yinyu

Quelle: Mathematics of Operations Research. Feb2020, Vol. 45 Issue 1, p233-271. 39p.

Schlagwörter: *MATHEMATICAL optimization, PERMUTATIONS, LINEAR equations, LINEAR systems

A column generation algorithm for choice-based network revenue management

Autoren: Bront, J.J.M. Méndez-Díaz, I. Vulcano, G.

Schlagwörter: 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

Verfügbarkeit: https://hdl.handle.net/20.500.12110/paper_0030364X_v57_n3_p769_Bront

Denser Packings Obtained in O(n log log n) Time.

Autoren: Pisinger, David¹ pisinger@diku.dk

Quelle: INFORMS Journal on Computing. Summer2007, Vol. 19 Issue 3, p395-405. 11p. 6 Diagrams, 13 Charts, 1 Graph.

Schlagwörter: *COMPUTER systems, *CONSTRAINT programming, *ALGORITHM research, *SIMULATED annealing, *VERY large scale circuit integration, *INTEGER programming, *HEURISTIC programming, *COMPUTATIONAL complexity, *PRODUCTION scheduling, *CUTTING stock problem

Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction.

Autoren: Pisinger, W. David Rasmussen, Anders Bo Sandvik, Rune

Quelle: INFORMS Journal on Computing. Spring2007, Vol. 19 Issue 2, p280-290. 11p. 1 Diagram, 10 Charts.

Schlagwörter: *QUADRATIC programming, *KNAPSACK problems, *INTEGER programming, *ALGORITHMS, *COMPUTATIONAL complexity, *MATHEMATICAL programming, *RELAXATION methods (Mathematics)

Computing shortest paths for transportation of hazardous materials in continuous spaces

Autoren: Díaz-Báñez, J.M. Gómez, F. Toussaint, G.T.

Quelle: Journal of Food Engineering. Oct2005, Vol. 70 Issue 3, p293-298. 6p.

Schlagwörter: *HAZARDOUS substances, *TRANSPORTATION, *ALGORITHMS, *MATHEMATICAL optimization, *PATH analysis (Statistics)

Multiple Sequence Alignment as a Facility-Location Problem.

Autoren: Just, Winfried Vedova, Gianluca Della

Quelle: INFORMS Journal on Computing. Fall2004, Vol. 16 Issue 4, p430-440. 11p.

Schlagwörter: *ALGORITHMS, *FOUNDATIONS of arithmetic, *COMPUTATIONAL complexity, *ELECTRONIC data processing, *MOLECULAR biology, *BIOINFORMATICS, *POLYNOMIALS