scientific article; zbMATH DE number 1297592
From MaRDI portal
Publication:4245749
zbMath0914.90002MaRDI QIDQ4245749
No author found.
Publication date: 9 June 1999
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Combinatorial optimization (90C27) Collections of articles of miscellaneous specific interest (00B15) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00)
Related Items (22)
Balanced independent and dominating sets on colored interval graphs ⋮ The quadratic knapsack problem -- a survey ⋮ A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands ⋮ A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem ⋮ An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization ⋮ An opposition-based memetic algorithm for the maximum quasi-clique problem ⋮ A two-phase tabu search based evolutionary algorithm for the maximum diversity problem ⋮ Combining incomplete search and clause generation: an application to the orienteering problems with time windows ⋮ A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers ⋮ Learning reward machines: a study in partially observable reinforcement learning ⋮ Graph labelings obtainable by random walks ⋮ Multiobjective fuzzy linear programming problems with fuzzy decision variables. ⋮ A parallel adaptive memory algorithm for the capacitated modular hub location problem ⋮ An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints ⋮ \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices ⋮ Worst-case analysis of the subset sum algorithm for bin packing. ⋮ Selfish Bin Packing ⋮ A note on the complexity of longest path problems related to graph coloring ⋮ A hybrid evolutionary search for the generalized quadratic multiple knapsack problem ⋮ A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks ⋮ Finding the maximum multi improvement on neighborhood exploration ⋮ A fast algorithm for strongly correlated knapsack problems
This page was built for publication:
