Výsledky vyhľadávania - OR/MS Subject Classifications: Primary: Programming*
-
1
Optimization in the Heisenberg group
ISSN: 0233-1934, 1029-4945Vydavateľské údaje: Taylor & Francis Group 01.08.2006Vydané v Optimization (01.08.2006)“…In this article, the local unconstrained and the constrained optimization problems in the Heisenberg group are investigated. The framework on which we work is…”
Získať plný text
Journal Article -
2
A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem
ISSN: 0364-765X, 1526-5471Vydavateľské údaje: Linthicum INFORMS 01.11.2009Vydané v Mathematics of operations research (01.11.2009)“… In this paper, we introduce a new semidefinite programming (SDP) relaxation for generating bounds for the QAP in the trace formulation…”
Získať plný text
Journal Article -
3
Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model
ISSN: 0364-765X, 1526-5471Vydavateľské údaje: Linthicum INFORMS 01.11.2009Vydané v Mathematics of operations research (01.11.2009)“…Consider the supposedly simple problem of computing a point in a convex set that is conveyed by a separation oracle with no further information (e.g., no…”
Získať plný text
Journal Article -
4
Gear Composition of Stable Set Polytopes and G-Perfection
ISSN: 0364-765X, 1526-5471Vydavateľské údaje: Linthicum Institute for Operations Research and the Management Sciences 01.11.2009Vydané v Mathematics of operations research (01.11.2009)“…Graphs obtained by applying the gear composition to a given graph H are called geared graphs . We show how a linear description of the stable set polytope…”
Získať plný text
Journal Article -
5
A Strongly Polynomial Algorithm for Controlled Queues
ISSN: 0364-765X, 1526-5471Vydavateľské údaje: Linthicum INFORMS 01.11.2009Vydané v Mathematics of operations research (01.11.2009)“…We consider the problem of computing optimal policies of finite-state finite-action Markov decision processes (MDPs). A reduction to a continuum of constrained…”
Získať plný text
Journal Article -
6
On the Maximum Quadratic Assignment Problem
ISSN: 0364-765X, 1526-5471Vydavateľské údaje: Linthicum INFORMS 01.11.2009Vydané v Mathematics of operations research (01.11.2009)“…Quadratic assignment is a basic problem in combinatorial optimization that generalizes several other problems such as traveling salesman, linear arrangement,…”
Získať plný text
Journal Article -
7
On a Continuous-Time Game with Incomplete Information
ISSN: 0364-765X, 1526-5471Vydavateľské údaje: Linthicum INFORMS 01.11.2009Vydané v Mathematics of operations research (01.11.2009)“…For zero-sum two-player continuous-time games with integral payoff and incomplete information on one side, the authors show that the optimal strategy of the…”
Získať plný text
Journal Article -
8
Locating Objects in the Plane Using Global Optimization Techniques
ISSN: 0364-765X, 1526-5471Vydavateľské údaje: Linthicum INFORMS 01.11.2009Vydané v Mathematics of operations research (01.11.2009)“…We address the problem of locating objects in the plane such as segments, arcs of circumferences, arbitrary convex sets, their complements or their boundaries…”
Získať plný text
Journal Article -
9
Bid-Price Controls for Network Revenue Management: Martingale Characterization of Optimal Bid Prices
ISSN: 0364-765X, 1526-5471Vydavateľské údaje: Linthicum INFORMS 01.11.2009Vydané v Mathematics of operations research (01.11.2009)“…We consider a continuous-time, rate-based model of network revenue management. Under mild assumptions, we construct a simple -optimal bid-price control, which…”
Získať plný text
Journal Article