A technique for obtaining true approximations for k-center with covering constraints. [PDF]
Math Program, 2022 Anegg G +3 more
europepmc +1 more source
Fiduciary Responsibility and the Green Energy Act, 2009 (Ontario, Canada). [PDF]
Environ Justice, 2021 Tsuji SRJ.
europepmc +1 more source
Convex-Concave fitting to successively updated data and its application to covid-19 analysis. [PDF]
J Comb Optim, 2022 Davos DE, Demetriou IC.
europepmc +1 more source
A duality based 2-approximation algorithm for maximum agreement forest. [PDF]
Math Program, 2023 Olver N +4 more
europepmc +1 more source
Recent Results on Douglas–Rachford Methods
, 2013 Recent positive experiences applying convex feasibility algorithms of Douglas–Rachford type to highly combinatorial and far from convex problems are described.
Borwein, Jonathan M. +2 more
core
An optimal monotone contention resolution scheme for bipartite matchings via a polyhedral viewpoint. [PDF]
Math Program, 2022 Bruggmann S, Zenklusen R.
europepmc +1 more source
Special issue on: Computational discrete optimization
EURO Journal on Computational Optimization, 2020 ArieM.C.A. Koster, Clemens Thielen
doaj +1 more source
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. [PDF]
Math Program, 2020 Gaar E, Rendl F.
europepmc +1 more source
Second-order cover inequalities Mathematics Subject Classification 90C10 · 90C27
, 2008 We introduce a new class of second-order cover inequalities whose members are generally stronger than the classical knapsack cover inequalities that are commonly used to enhance the performance of branch-and-cut methods for 0-1 integer programming ...
core
Approximation Algorithms for Combinatorial Multicriteria Optimization Problems [PDF]
, 1999 The computational complexity of combinatorial multiple objective programming problems is investigated. INP -completeness and #P -completeness results are presented.
Matthias Ehrgott, Ehrgott, Matthias
core