Zobrazeno 1 - 10
of 466
pro vyhledávání: '"Wolsey, Laurence A."'
Given a tree G = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the "rooted subtree problem", is to find a maximum weight subtree, with a specified root, from a given set of subtre
Externí odkaz:
http://hdl.handle.net/1721.1/5407
A partial description of the convex hull of solutions to the economic lot-sizing problem with start-up costs (ELSS) has been derived recently. Here a larger class of valid inequalities is given and it is shown that these inequalities describe the con
Externí odkaz:
http://hdl.handle.net/1721.1/5269
Publikováno v:
In Discrete Optimization May 2020 36
Publikováno v:
Transportation Science, 2018 May 01. 52(3), 497-508.
Externí odkaz:
https://www.jstor.org/stable/48747909
Autor:
Aardal, Karen, Wolsey, Laurence A.
We study different extended formulations for the set $X = \{x\in\mathbb{Z}^n \mid Ax = Ax^0\}$ in order to tackle the feasibility problem for the set $X_+=X \cap \mathbb{Z}^n_+$. Here the goal is not to find an improved polyhedral relaxation of conv$
Externí odkaz:
http://arxiv.org/abs/math/0702881
Autor:
Wolsey, Laurence A., Yaman, Hande
Publikováno v:
In Discrete Optimization November 2018 30:108-120
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Wolsey, Laurence A.
Publikováno v:
Operations Research, 2003 Jul 01. 51(4), 557-565.
Externí odkaz:
https://www.jstor.org/stable/4132419
Autor:
Wolsey, Laurence A.
Publikováno v:
Management Science, 2002 Dec 01. 48(12), 1587-1602.
Externí odkaz:
https://www.jstor.org/stable/822525