Výsledky vyhledávání - OR/MS Subject Classifications: Primary: Programming

Optimization in the Heisenberg group Autor Calogero, A., Carcano, G., Pini, R.

“…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ískat plný text

A Low-Dimensional Semidefinite Relaxation for the Quadratic Assignment Problem Autor Ding, Yichuan, Wolkowicz, Henry

“… In this paper, we introduce a new semidefinite programming (SDP) relaxation for generating bounds for the QAP in the trace formulation…”
Získat plný text

Equivalence of Convex Problem Geometry and Computational Complexity in the Separation Oracle Model Autor Freund, Robert M, Vera, Jorge R

“…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ískat plný text

Gear Composition of Stable Set Polytopes and G-Perfection Autor Galluccio, Anna, Gentile, Claudio, Ventura, Paolo

“…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ískat plný text

A Strongly Polynomial Algorithm for Controlled Queues Autor Zadorojniy, Alexander, Even, Guy, Shwartz, Adam

“…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ískat plný text

Locating Objects in the Plane Using Global Optimization Techniques Autor Blanquero, Rafael, Carrizosa, Emilio, Hansen, Pierre

“…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ískat plný text

Bid-Price Controls for Network Revenue Management: Martingale Characterization of Optimal Bid Prices Autor Akan, Mustafa, Ata, Baris

“…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ískat plný text

On the Maximum Quadratic Assignment Problem Autor Nagarajan, Viswanath, Sviridenko, Maxim

“…Quadratic assignment is a basic problem in combinatorial optimization that generalizes several other problems such as traveling salesman, linear arrangement,…”
Získat plný text

On a Continuous-Time Game with Incomplete Information Autor Cardaliaguet, Pierre, Rainer, Catherine

“…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ískat plný text