Results 91 to 100 of about 148 (126)

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows

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., de Pablo, D. Alcaide López, Sedeño-Noda, A.   +2 more
core  

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  

A Novel Binary Dream Optimization Algorithm with Data-Driven Repair for the Set Covering Problem. [PDF]

Biomimetics (Basel)
Crawford B, Caballero H, Astorga G, Cisternas-Caneo F, Becerra-Rozas M, Baeza A, Bernales G, Puga P, Giachetti G, Soto R.   +9 more
europepmc   +1 more source

Computing The Combinatorial Canonical Form Of A Layered Mixed Matrix

, 1987
. This paper presents an improved algorithm for computing the Combinatorial Canonical Form (CCF) of a layered mixed matrix A = ` Q T ' , which consists of a numerical matrix Q and a generic matrix T .
Kazuo Murota, Mark Scharbrodt
core  

New Binary Reptile Search Algorithms for Binary Optimization Problems. [PDF]

Biomimetics (Basel)
Crawford B, López Cortés B, Cisternas-Caneo F, Gómez-Pulido JM, Olivares R, Soto R, Barrera-Garcia J, Brante-Aguilera C, Giachetti G.   +8 more
europepmc   +1 more source

Edge Colouring Reduced Indifference Graphs

, 1999
The chromatic index problem -- finding the minimum number of colours required for colouring the edges of a graph -- is still unsolved for indifference graphs, whose vertices can be linearly ordered so that the vertices contained in the same maximal ...
Celina M. H. De Figueiredo, Joao Meidanis, Célia Picinin de Mello, Carmen Ortiz   +3 more
core  

A linear time algorithm for linearizing quadratic and higher-order shortest path problems. [PDF]

Math Program
Çela E, Klinz B, Lendl S, Woeginger GJ, Wulf L.   +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

Advances on strictly Δ -modular IPs. [PDF]

Math Program
Nägele M, Nöbel C, Santiago R, Zenklusen R.   +3 more
europepmc   +1 more source

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