scientific article; zbMATH DE number 1297592
From MaRDI portal
Publication:4245749
Collections of articles of miscellaneous specific interest (00B15) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to operations research and mathematical programming (90-00) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Combinatorial optimization (90C27)
Cited in
(33)- A fast algorithm for strongly correlated knapsack problems
- Multiobjective fuzzy linear programming problems with fuzzy decision variables.
- Worst-case analysis of the subset sum algorithm for bin packing.
- A note on the complexity of longest path problems related to graph coloring
- Combinatorial optimization. Polyhedra and efficiency (3 volumes)
- A memetic algorithm based on reformulation local search for minimum sum-of-squares clustering in networks
- Finding the maximum multi improvement on neighborhood exploration
- An opposition-based memetic algorithm for the maximum quasi-clique problem
- A hybrid evolutionary search for the generalized quadratic multiple knapsack problem
- 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
- A two-phase tabu search based evolutionary algorithm for the maximum diversity problem
- \texttt{Procrustes}: a python library to find transformations that maximize the similarity between matrices
- Selfish Bin Packing
- scientific article; zbMATH DE number 1198942 (Why is no real title available?)
- scientific article; zbMATH DE number 1297591 (Why is no real title available?)
- 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
- 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
- Local Search for SMT on Linear Integer Arithmetic
- Learning driven three-phase search for the maximum independent union of cliques problem
- Deep clustering of the traveling salesman problem to parallelize its solution
- Genetic engineering algorithm (GEA): an efficient metaheuristic algorithm for solving combinatorial optimization problems
- Combinatorial optimization with dual mean-field dynamics
- Reducing income variability in natural resource portfolios via integer programming
- Penalty free variable selection for high-dimensional linear models
- Faster algorithms for the alignment of sparse correlated Erdős-Rényi random graphs
- Balanced independent and dominating sets on colored interval graphs
- The quadratic knapsack problem -- a survey
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4245749)
