Search Results - "Analysis of Algorithms: Computational Complexity"
-
1
Multilevel Monte Carlo Path Simulation
ISSN: 0030-364X, 1526-5463Published: Linthicum, MD INFORMS 01.05.2008Published in 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…”
Get full text
Journal Article -
2
A Column Generation Algorithm for Choice-Based Network Revenue Management
ISSN: 0030-364X, 1526-5463Published: Hanover, MD INFORMS 01.05.2009Published in 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…”
Get full text
Journal Article -
3
Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
ISSN: 1091-9856, 1526-5528, 1091-9856Published: Linthicum INFORMS 22.03.2007Published in 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…”
Get full text
Journal Article -
4
An Analysis of Pediatric Vaccine Formulary Selection Problems
ISSN: 0030-364X, 1526-5463Published: Linthicum INFORMS 01.11.2008Published in 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…”
Get full text
Journal Article -
5
On the Effectiveness of Zero-Inventory-Ordering Policies for the Economic Lot-Sizing Model with a Class of Piecewise Linear Cost Structures
ISSN: 0030-364X, 1526-5463Published: Linthicum INFORMS 01.11.2002Published in 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…”
Get full text
Journal Article -
6
Computing shortest paths for transportation of hazardous materials in continuous spaces
ISSN: 0260-8774, 1873-5770Published: Elsevier Ltd 01.10.2005Published in 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…”
Get full text
Journal Article -
7
Denser Packings Obtained in O(n log log n) Time
ISSN: 1091-9856, 1526-5528, 1091-9856Published: Linthicum INFORMS 22.06.2007Published in 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…”
Get full text
Journal Article -
8
Heuristic and Special Case Algorithms for Dispersion Problems
ISSN: 0030-364X, 1526-5463Published: Linthicum, MD INFORMS 01.03.1994Published in 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…”
Get full text
Journal Article -
9
Scheduling Batches with Sequential Job Processing for Two-Machine Flow and Open Shops
ISSN: 1091-9856, 1526-5528, 1091-9856Published: Linthicum INFORMS 22.03.2001Published in 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…”
Get full text
Journal Article -
10
Bioinformatics and Management Science: Some Common Tools and Techniques
ISSN: 0030-364X, 1526-5463Published: Linthicum INFORMS 01.03.2004Published in 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…”
Get full text
Journal Article -
11
Multiple Sequence Alignment as a Facility-Location Problem
ISSN: 1091-9856, 1526-5528, 1091-9856Published: Linthicum INFORMS 01.11.2004Published in 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…”
Get full text
Journal Article -
12
Tutorial on computational complexity
ISSN: 2644-0865, 2644-0873Published: Linthicum Institute for Operations Research and the Management Sciences 01.05.2002Published in 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,…”
Get full text
Journal Article -
13
Computational Complexity of Some Maximum Average Weight Problems with Precedence Constraints
ISSN: 0030-364X, 1526-5463Published: Baltimore, Md INFORMS 01.07.1994Published in 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…”
Get full text
Journal Article -
14
Pareto Optima of Multicriteria Integer Linear Programs
ISSN: 1091-9856, 1091-9856Published: Linthicum Institute for Operations Research and the Management Sciences 22.12.2009Published in 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…”
Get full text
Journal Article -
15
An Analysis of Pediatric Vaccine Formulary Selection Problems: Special Issue on Operations Research in Health Care
ISSN: 0030-364XPublished: Hanover, MD Institute for Operations Research and the Management Sciences 2008Published in Operations research (2008)Get full text
Journal Article -
16
Computing shortest paths for transportation of hazardous materials in continuous spaces: Operational research and food logistics
ISSN: 0260-8774Published: Oxford Elsevier 2005Published in Journal of food engineering (2005)Get full text
Journal Article