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

  • Zobrazuji výsledky 1 - 16 z 16
Upřesnit hledání
  1. 1

    Multilevel Monte Carlo Path Simulation Autor Giles, Michael B

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum, MD INFORMS 01.05.2008
    Vydáno v Operations research (01.05.2008)
    “…We show that multigrid ideas can be used to reduce the computational complexity of estimating an expected value arising from a stochastic differential equation…”
    Získat plný text
    Journal Article
  2. 2

    A Column Generation Algorithm for Choice-Based Network Revenue Management Autor Bront, Juan Jose Miranda, Mendez-Diaz, Isabel, Vulcano, Gustavo

    ISSN: 0030-364X, 1526-5463
    Vydáno: Hanover, MD INFORMS 01.05.2009
    Vydáno v Operations research (01.05.2009)
    “…During the past few years, there has been a trend to enrich traditional revenue management models built upon the independent demand paradigm by accounting for…”
    Získat plný text
    Journal Article
  3. 3

    Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction Autor Pisinger, W. David, Rasmussen, Anders Bo, Sandvik, Rune

    ISSN: 1091-9856, 1526-5528, 1091-9856
    Vydáno: Linthicum INFORMS 22.03.2007
    Vydáno v INFORMS journal on computing (22.03.2007)
    “…The quadratic knapsack problem (QKP) calls for maximizing a quadratic objective function subject to a knapsack constraint. All coefficients are assumed to be…”
    Získat plný text
    Journal Article
  4. 4

    An Analysis of Pediatric Vaccine Formulary Selection Problems Autor Hall, Shane N, Jacobson, Sheldon H, Sewell, Edward C

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum INFORMS 01.11.2008
    Vydáno v Operations research (01.11.2008)
    “…Vaccination against infectious disease is hailed as one of the great achievements in public health. However, the United States Recommended Childhood…”
    Získat plný text
    Journal Article
  5. 5

    On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures Autor Chan, Lap Mui Ann, Muriel, Ana, Shen, Zuo-Jun, Simchi-Levi, David

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum INFORMS 01.11.2002
    Vydáno v Operations research (01.11.2002)
    “…We consider an economic lot-sizing problem with a special class of piecewise linear ordering costs, which we refer to as the class of modified all-unit…”
    Získat plný text
    Journal Article
  6. 6

    Computing shortest paths for transportation of hazardous materials in continuous spaces Autor Díaz-Báñez, J.M., Gómez, F., Toussaint, G.T.

    ISSN: 0260-8774, 1873-5770
    Vydáno: Elsevier Ltd 01.10.2005
    Vydáno v Journal of food engineering (01.10.2005)
    “…This paper is concerned about the problem of locating a path for a shipment of dangerous goods between a pre-specified origin–destination pair on the plane…”
    Získat plný text
    Journal Article
  7. 7

    Denser Packings Obtained in O(n log log n) Time Autor Pisinger, David

    ISSN: 1091-9856, 1526-5528, 1091-9856
    Vydáno: Linthicum INFORMS 22.06.2007
    Vydáno v INFORMS journal on computing (22.06.2007)
    “…The placement problem is that of packing a set of rectangles into a minimum-area enclosing rectangle. Since it is difficult to optimize directly on a…”
    Získat plný text
    Journal Article
  8. 8

    Heuristic and Special Case Algorithms for Dispersion Problems Autor Ravi, S. S, Rosenkrantz, D. J, Tayi, G. K

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum, MD INFORMS 01.03.1994
    Vydáno v Operations research (01.03.1994)
    “…The dispersion problem arises in selecting facilities to maximize some function of the distances between the facilities. The problem also arises in selecting…”
    Získat plný text
    Journal Article
  9. 9

    Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops Autor Glass, C.A, Potts, C.N, Strusevich, V.A

    ISSN: 1091-9856, 1526-5528, 1091-9856
    Vydáno: Linthicum INFORMS 22.03.2001
    Vydáno v INFORMS journal on computing (22.03.2001)
    “…In this paper, we study a problem of scheduling and batching on two machines in a flow-shop and open-shop environment. Each machine processes operations in…”
    Získat plný text
    Journal Article
  10. 10

    Bioinformatics and Management Science: Some Common Tools and Techniques Autor Abbas, Ali E, Holmes, Susan P

    ISSN: 0030-364X, 1526-5463
    Vydáno: Linthicum INFORMS 01.03.2004
    Vydáno v Operations research (01.03.2004)
    “…In April of 2003, Science (2003) and Nature (2003) published special issues marking two significant achievements in the history of science: the 50th…”
    Získat plný text
    Journal Article
  11. 11

    Multiple Sequence Alignment as a Facility-Location Problem Autor Just, Winfried, Vedova, Gianluca Della

    ISSN: 1091-9856, 1526-5528, 1091-9856
    Vydáno: Linthicum INFORMS 01.11.2004
    Vydáno v INFORMS journal on computing (01.11.2004)
    “…A connection is made between certain multiple-sequence alignment problems and facility-location problems, and the existence of a PTAS (polynomial-time…”
    Získat plný text
    Journal Article
  12. 12

    Tutorial on computational complexity Autor Tovey, Graig A

    ISSN: 2644-0865, 2644-0873
    Vydáno: Linthicum Institute for Operations Research and the Management Sciences 01.05.2002
    Vydáno v Interfaces (Providence) (01.05.2002)
    “…Computational complexity measures how much work is required to solve different problems. It provides a useful classification tool for OR/MS practitioners,…”
    Získat plný text
    Journal Article
  13. 13

    Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints Autor Faigle, Ulrich, Kern, Walter

    ISSN: 0030-364X, 1526-5463
    Vydáno: Baltimore, Md INFORMS 01.07.1994
    Vydáno v Operations research (01.07.1994)
    “…Maximum average weight ideal problems in ordered sets arise from modeling variants of the investment problem and, in particular, learning problems in the…”
    Získat plný text
    Journal Article
  14. 14

    Pareto Optima of Multicriteria Integer Linear Programs Autor De Loera, Jesús A, Hemmecke, Raymond, Köppe, Matthias

    ISSN: 1091-9856, 1091-9856
    Vydáno: Linthicum Institute for Operations Research and the Management Sciences 22.12.2009
    Vydáno v INFORMS journal on computing (22.12.2009)
    “…We settle the computational complexity of fundamental questions related to multicriteria integer linear programs, when the dimensions of the strategy space and…”
    Získat plný text
    Journal Article
  15. 15
  16. 16