Results 91 to 100 of about 143 (125)
A 4 3 -approximation for the maximum leaf spanning arborescence problem in DAGs. [PDF]
Math ProgramNeuwohner M.
europepmc +1 more source
Total-Chromatic Number and Chromatic Index of Dually Chordal Graphs
, 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
A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem. [PDF]
Biomimetics (Basel)Crawford B +9 more
europepmc +1 more source
New Binary Reptile Search Algorithms for Binary Optimization Problems. [PDF]
Biomimetics (Basel)Crawford B +8 more
europepmc +1 more source
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. [PDF]
Math ProgramÇela E +4 more
europepmc +1 more source
New algorithms for maximum disjoint paths based on tree-likeness. [PDF]
Math Program, 2018 Fleszar K, Mnich M, Spoerhase J.
europepmc +1 more source
Solving Euclidean Distance Matrix Completion Problems Via Semidefinite Programming
, 1997 . Given a partial symmetric matrix A with only certain elements specified, the Euclidean distance matrix completion problem (EDMCP) is to find the unspecified elements of A that make A a Euclidean distance matrix (EDM).
Abdo Y. Alfakih, Henry Wolkowicz
core
Generating subtour elimination constraints for the TSP from pure integer solutions. [PDF]
Cent Eur J Oper Res, 2017 Pferschy U, Staněk R.
europepmc +1 more source
This paper deals with several bicriteria open-shop scheduling problems where jobs are pre-emptable and their corresponding time-windows must be strictly respected. The criteria are a performance cost and the makespan.
González-Martín, C. +2 more
core