A MAX-CUT formulation of 0/1 programs (Englisch)
- Neue Suche nach: Lasserre, Jean B
- Neue Suche nach: Lasserre, Jean B
In:
Operations research letters
;
44
, 2
; 158-164
;
2016
-
ISSN:
- Aufsatz (Zeitschrift) / Print
-
Titel:A MAX-CUT formulation of 0/1 programs
-
Beteiligte:Lasserre, Jean B ( Autor:in )
-
Erschienen in:Operations research letters ; 44, 2 ; 158-164
-
Verlag:
- Neue Suche nach: Elsevier
-
Erscheinungsort:Amsterdam [u.a.]
-
Erscheinungsdatum:2016
-
ISSN:
-
ZDBID:
-
DOI:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Print
-
Sprache:Englisch
- Neue Suche nach: 85.03 / 85.00 / 85.03 / 85.00
- Weitere Informationen zu Basisklassifikation
-
Schlagwörter:
-
Klassifikation:
-
Datenquelle:
Inhaltsverzeichnis – Band 44, Ausgabe 2
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 153
-
Permutation schedules for a two-machine flow shop with storageFung, Joey et al. | 2016
- 158
-
A MAX-CUT formulation of 0/1 programsLasserre, Jean B et al. | 2016
- 165
-
Coupled bisection for root orderingPallone, Stephen N et al. | 2016
- 170
-
On a cardinality-constrained transportation problem with market choiceWalter, Matthias et al. | 2016
- 174
-
Reconstructing edge-disjoint paths fasterXu, Chao et al. | 2016
- 177
-
Connectedness in vector equilibrium problems involving cones with possibly empty interiorSach, P.H et al. | 2016
- 180
-
Maximizing expected utility over a knapsack constraintYu, Jiajin et al. | 2016
- 186
-
Monotonicity of base stock policiesde la Cruz, Nha-Nghi et al. | 2016
- 191
-
A note on hierarchical hubbing for a generalization of the VPN problemOlver, Neil et al. | 2016
- 196
-
Regulating an observable M/M/1 queueHaviv, Moshe et al. | 2016
- 199
-
A note on the k-minimum spanning tree problem on circlesKnecht, Thomas et al. | 2016
- 202
-
A note on optimal risk sharing on Lp spacesKromer, Eduard et al. | 2016
- 208
-
A new rule for the problem of sharing the revenue from museum passesBergantiños, Gustavo et al. | 2016
- 212
-
Optimal investment strategy under time-inconsistent preferences and high-water mark contractA, Chunxiang et al. | 2016
- 219
-
Equivalence nucleolus for coalitional games with externalitiesTripathi, Rajeev R et al. | 2016
- 225
-
On packing and covering polyhedra in infinite dimensionsRademacher, Luis et al. | 2016
- 231
-
Tridiagonal matrices with dominant diagonals and applicationsChang, Winston W et al. | 2016
- 234
-
Discrete choice models based on random walksBerbeglia, Gerardo et al. | 2016
- 238
-
Forward-buying and the naive newsvendorKhouja, Moutaz et al. | 2016
- 243
-
A polyhedral study on 0–1 knapsack problems with set packing constraintsCañavate, Roberto J et al. | 2016
- 250
-
On sabotage gamesKvasov, Dmitriy et al. | 2016
- 255
-
Approximating the minimum rank of a graph via alternating projectionKenter, Franklin H.J. et al. | 2016
- 260
-
Nondifferentiable fractional semi-infinite multiobjective optimization problemsChuong, Thai Doan et al. | 2016
- 267
-
Improved bound on the worst case complexity of Policy IterationHollanders, Romain / Gerencsér, Balázs / Delvenne, Jean-Charles / Jungers, Raphaël M. et al. | 2016
- 273
-
More on batched bin packingEpstein, Leah et al. | 2016
- 278
-
An extension of the stochastic Joint-Replenishment Problem under the class of cyclic policiesBraglia, Marcello / Castellano, Davide / Gallo, Mosè et al. | 2016
- 285
-
DEA models equivalent to general Nth order stochastic dominance efficiency testsBranda, Martin / Kopa, Miloš et al. | 2016
-
Editorial Board| 2016