Research trends in combinatorial optimization
From MaRDI portal
Publication:6091419
DOI10.1111/itor.12996arXiv2012.01294OpenAlexW3167593369MaRDI QIDQ6091419
Kenneth Sörensen, Unnamed Author, Pablo San Segundo, Unnamed Author, Unnamed Author
Publication date: 24 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2012.01294
combinatorial optimizationmetaheuristicsgenetic algorithmsexact algorithmsOR in energybibliometric analysis
Related Items
Cites Work
- Optimization by Simulated Annealing
- A feasible method for optimization with orthogonality constraints
- An index to quantify an individual's scientific research output
- A survey of recent research on location-routing problems
- Long term production planning of open pit mines by ant colony optimization
- Maintenance scheduling in the electricity industry: a literature review
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
- A new exact maximum clique algorithm for large and massive sparse graphs
- Problem difficulty for tabu search in job-shop scheduling
- Metaheuristics in combinatorial optimization
- A survey for the quadratic assignment problem
- Calculating distances for dissimilar strings: the shortest path formulation revisited
- Location-routing: issues, models and methods
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- A survey of variants and extensions of the resource-constrained project scheduling problem
- Development of a new approach for deterministic supply chain network design
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- ``Neural computation of decisions in optimization problems
- Integer programming formulation of combinatorial optimization problems
- A decision support system for urban waste management
- Variable neighborhood search
- Some thoughts on combinatorial optimisation
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
- The Benders decomposition algorithm: a literature review
- Greedy randomized adaptive search procedures
- Designing and reporting on computational experiments with heuristic methods
- Testing heuristics: We have it all wrong
- Information-theoretic approximations of the nonnegative rank
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Computing in combinatorial optimization
- A generic exact solver for vehicle routing and related problems
- A review of dynamic vehicle routing problems
- Personnel scheduling: a literature review
- Recent advances in robust optimization: an overview
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- Benchmarks for basic scheduling problems
- Multi-objective vehicle routing problems
- Fast linear iterations for distributed averaging
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- Ant colony optimization theory: a survey
- The Design of Approximation Algorithms
- Rules for Biologically Inspired Adaptive Network Design
- Integer Programming
- Handbook of Heuristics
- Tabu Search—Part I
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Uncertainty principles and ideal atomic decomposition
- Handbook of Combinatorial Optimization
- Incremental Upper Bound for the Maximum Clique Problem
- Why Is Maximum Clique Often Easy in Practice?
- Metaheuristics—the metaphor exposed
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- A critical analysis of the “improved Clarke and Wright savings algorithm”
- Unnamed Item
