Similar Search Results

Global Quadratic Optimization Via Conic Relaxation.

Nesterov, Y. - Center for Operations Research and Econometrics (CORE), … - 1998

We present a convex conic relaxation for a problem of maximising an indefinite quadratic form over a set of convex constraints on the squared variables. We show that for all these problems we get at least 12/37 relative accuracy of the approximation. In the second part of the paper we derive the...

Persistent link: https://www.econbiz.de/10005779408

Scheduling Projects with Labor Constraints.

Cavalcante, C.C.B.; de Souza, C.C.; Savelsbergh, M.W.P.; … - Center for Operations Research and Econometrics (CORE), … - 1998

In this paper we consider a labor constrained scheduling problem (LCSP) which is a simplification of a practical problem arising in industry. Jobs are subject to precedence constraints and have specified processing times. Moreover, for each job the labor requirements varies as the job is...

Persistent link: https://www.econbiz.de/10005669315

Revenue management for operations with urgent orders

LAMAS, Alejandro; MLINAR, Tanja; CHEVALIER, Philippe - Center for Operations Research and Econometrics (CORE), … - 2013

This article is motivated by the case of a company manufacturing industrial equipment that faces two types of demand: on the one hand there are the so-called regular orders for installations or refurbishing of existing facilities, these orders have a relatively long lead time; on the other hand...

Persistent link: https://www.econbiz.de/10010927721

Heuristics for exact nonnegative matrix factorization

Gillis, Nicolas; Glineur, François; Tuyttens, Daniel; … - Center for Operations Research and Econometrics (CORE), … - 2015

X = WH. In this paper, we propose two heuristics for exact NMF, one inspired from simulated annealing and the other from … the greedy randomized adaptive search procedure. We show that these two heuristics are able to compute exact nonnegative … also consider a hybridization between these two heuristics that allows us to combine the advantages of both methods …

Persistent link: https://www.econbiz.de/10011246293

LS-LIB: a library of reformulations, cut separation algorithms and primal heuristics in a high-level modeling language for solving MIP production planning problems

POCHET, Yves; VAN VYVE, Mathieu; WOLSEY, Laurence A. - Center for Operations Research and Econometrics (CORE), … - 2005

generation, and heuristics to find good feasible solutions quickly. The user must provide an initial formulation of his problem …

Persistent link: https://www.econbiz.de/10005042884

A branch-and-cut algorithm for the single commodity uncapacitated fixed charge network flow problem.

ORTEGA, Francisco; WOLSEY, Laurence - Center for Operations Research and Econometrics (CORE), … - 2000

-nd includes a separation heuristic for the dicut inequalities, and problem specific primal heuristics, branching and pruning rules …

Persistent link: https://www.econbiz.de/10005043458

New formulation and resolution method for the p-center problem

ELLOUMI, Sourour; LABBÉ, Martine; POCHET, Yves - Center for Operations Research and Econometrics (CORE), … - 2001

The p-Center problem consists in locating p facilities among a set of M possible locations and assigning N clients to them in order to minimize the maximum distance between a client and the facility to which it is allocated. We present a new integer linear programming formulation for this...

Persistent link: https://www.econbiz.de/10005043737