Results 71 to 80 of about 148 (126)

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

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

A Greedy Randomized Adaptive Search Procedure For The Quadratic Assignment Problem

open access: yes, 1994
. A greedy randomized adaptive search procedure (GRASP) is a randomized heuristic that has been shown to quickly produce good quality solutions for a wide variety of combinatorial optimization problems.
Mauricio G.C. Resende   +4 more
core   +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

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  

© Hindawi Publishing Corp. EXTENDED BLOCKER, DELETION, AND CONTRACTION MAPS ON ANTICHAINS

open access: yes, 2002
Families of maps on the lattice of all antichains of a finite bounded poset that extend the blocker, deletion, and contraction maps on clutters are considered. Influence of the parameters of themaps is investigated.
Andrey O. Matveev
core  

Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs

open access: yes, 2007
A graph is dually chordal if it is the clique graph of a chordal graph. Alternatively, a graph is dually chordal if it admits a maximum neighbourhood order. This class generalizes known subclasses of chordal graphs such as doubly chordal graphs, strongly
Celina M. H. De Figueiredo   +3 more
core  

Home - About - Disclaimer - Privacy