Results 71 to 80 of about 143 (125)

A technique for obtaining true approximations for k-center with covering constraints. [PDF]

open access: yesMath Program, 2022
Anegg G   +3 more
europepmc   +1 more source

A duality based 2-approximation algorithm for maximum agreement forest. [PDF]

open access: yesMath Program, 2023
Olver N   +4 more
europepmc   +1 more source

Special issue on: Computational discrete optimization

open access: yesEURO Journal on Computational Optimization, 2020
ArieM.C.A. Koster, Clemens Thielen
doaj   +1 more source

Second-order cover inequalities Mathematics Subject Classification 90C10 · 90C27

open access: yes, 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]

open access: yes, 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  

The Closed Curve Filling Multidimensional Cube

open access: yes, 1994
. In the paper a construction of multidimensional cyclic (closed) spacefilling curve, which follows some ideas of the Sierpinski square-filling curve, is given. Key words.
Ewa Skubalska-Rafajlowicz
core  

Home - About - Disclaimer - Privacy