Cutting planes from two-term disjunctions

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Operations research letters
Weitere Verfasser: Bonami, Pierre (BerichterstatterIn), Conforti, Michele (BerichterstatterIn), Cornuéjols, Gérard (BerichterstatterIn), Molinaro, Marco (BerichterstatterIn), Zambelli, Giacomo (BerichterstatterIn)
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2013
Schlagworte:
Polyhedron > Two-term disjunction > Convex hull > Cutting plane > Aufsatz in Zeitschrift
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
An efficient algorithm for minimizing M-convex functions under a color-induced budget constraint 2023 Takazawa, Kenjiro
Single machine robust scheduling with budgeted uncertainty 2023 Bougeret, Marin
Answer to an open problem about stochastic comparison of parallel systems with geometric components 2023 Affouf, Mahmoud
On the complexity of scheduling unrelated parallel machines with limited preemptions 2023 Lenstra, Jan K.
Risk-averse stochastic optimal control : An efficiently computable statistical upper bound 2023 Guigues, Vincent
A gradient-based method to calculate (s,S) policies 2023 Dai, Weimin
A 3/2-approximation algorithm for the multiple Hamiltonian path problem with no prefixed endpoints 2023 Wu, Jun
On the complexity of Nurse Rostering problems 2023 Hartog, Steven J. M. den
On relaxations of the max k-cut problem formulations 2023 Fakhimi, Ramin
Orthogonal schedules in single round robin tournaments 2023 Lambers, Roel
A randomized algorithm for online metric b-matching 2023 Kalyanasundaram, Bala
Minimizing the effective graph resistance by adding links is NP-hard 2023 Kooij, Robert E.
Reciprocal degree distance and Hamiltonian properties of graphs 2023 Kori, Rajkaran
Communication-aware scheduling of precedence-constrained tasks on related machines 2023 Su, Yu
A strongly polynomial algorithm for the minimum maximum flow degree problem 2023 Campêlo, Manoel
A simplified completely positive reformulation for binary quadratic programs 2023 Wang, Qiao
Online load balancing on uniform machines with limited migration 2023 Maack, Marten
Half-cycle : a new formulation for modelling kidney exchange problems 2023 Delorme, Maxence
Tight distortion bounds for distributed metric voting on a line 2023 Voudouris, Alexandros A.
Future memories are not needed for large classes of POMDPs 2023 Cohen, Victor
Alle Artikel auflisten