The following pages link to (Q4245749):
Displaying 21 items.
- Balanced independent and dominating sets on colored interval graphs (Q831789) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- A fast algorithm for strongly correlated knapsack problems (Q1281395) (← links)
- Multiobjective fuzzy linear programming problems with fuzzy decision variables. (Q1399608) (← links)
- Worst-case analysis of the subset sum algorithm for bin packing. (Q1417595) (← links)
- A note on the complexity of longest path problems related to graph coloring (Q1433224) (← links)
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks (Q2053830) (← links)
- Finding the maximum multi improvement on neighborhood exploration (Q2070118) (← links)
- An opposition-based memetic algorithm for the maximum quasi-clique problem (Q2184091) (← links)
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem (Q2242328) (← links)
- A strategic oscillation simheuristic for the time capacitated arc routing problem with stochastic demands (Q2668800) (← links)
- A two-phase intensification tabu search algorithm for the maximum min-sum dispersion problem (Q2669523) (← links)
- An enhanced simulation-based iterated local search metaheuristic for gravity fed water distribution network design optimization (Q2669525) (← links)
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem (Q2673240) (← links)
- \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices (Q2695590) (← links)
- Selfish Bin Packing (Q3541100) (← links)
- A new two‐phase heuristic for a problem of food distribution with compartmentalized trucks and trailers (Q6079875) (← links)
- Learning reward machines: a study in partially observable reinforcement learning (Q6080653) (← links)
- Graph labelings obtainable by random walks (Q6087088) (← links)
- A parallel adaptive memory algorithm for the capacitated modular hub location problem (Q6164373) (← links)
- An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints (Q6166655) (← links)
