Research trends in combinatorial optimization
From MaRDI portal
Abstract: Real-world problems are becoming highly complex and, therefore, have to be solved with combinatorial optimisation (CO) techniques. Motivated by the strong increase of publications on CO, 8,393 articles from this research field are subjected to a bibliometric analysis. The corpus of literature is examined using mathematical methods and a novel algorithm for keyword analysis. In addition to the most relevant countries, organisations and authors as well as their collaborations, the most relevant CO problems, solution methods and application areas are presented. Publications on CO focus mainly on the development or enhancement of metaheuristics like genetic algorithms. The increasingly problem-oriented studies deal particularly with real-world applications within the energy sector, production sector or data management, which are of increasing relevance due to various global developments. The demonstration of global research trends in CO can support researchers in identifying the relevant issues regarding this expanding and transforming research area.
Recommendations
- Recent trends in combinatorial optimization
- scientific article; zbMATH DE number 4057296
- scientific article; zbMATH DE number 3887435
- Advances in combinatorial optimization
- scientific article; zbMATH DE number 4083376
- An overview of advances in combinatorial optimization related topics
- scientific article; zbMATH DE number 1102774
- scientific article; zbMATH DE number 863497
- New progress in combinatorial optimization
- Applications of combinatorial optimization
Cites work
- ``Neural computation of decisions in optimization problems
- A critical analysis of the “improved Clarke and Wright savings algorithm”
- A decision support system for urban waste management
- A feasible method for optimization with orthogonality constraints
- A generic exact solver for vehicle routing and related problems
- A new exact maximum clique algorithm for large and massive sparse graphs
- A review of dynamic vehicle routing problems
- A survey for the quadratic assignment problem
- A survey of recent research on location-routing problems
- A survey of variants and extensions of the resource-constrained project scheduling problem
- An index to quantify an individual's scientific research output
- Ant colony optimization theory: a survey
- Balancing assembly lines with variable parallel workplaces: problem definition and effective solution procedure
- Benchmarks for basic scheduling problems
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover
- Calculating distances for dissimilar strings: the shortest path formulation revisited
- Combining metaheuristics with mathematical programming, constraint programming and machine learning
- Computing in combinatorial optimization
- Cost-oriented assembly line balancing: model formulations, solution difficulty, upper and lower bounds
- Designing and reporting on computational experiments with heuristic methods
- Development of a new approach for deterministic supply chain network design
- Fast linear iterations for distributed averaging
- Greedy randomized adaptive search procedures
- Guidelines for the use of meta-heuristics in combinatorial optimization.
- Handbook of combinatorial optimization. In 5 volumes
- Handbook of heuristics
- scientific article; zbMATH DE number 3240929 (Why is no real title available?)
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- Incremental Upper Bound for the Maximum Clique Problem
- Information-theoretic approximations of the nonnegative rank
- Integer Programming
- Integer programming formulation of combinatorial optimization problems
- Location-routing: issues, models and methods
- Long term production planning of open pit mines by ant colony optimization
- Machine learning for combinatorial optimization: a methodological tour d'horizon
- Maintenance scheduling in the electricity industry: a literature review
- Metaheuristics -- the metaphor exposed
- Metaheuristics in combinatorial optimization
- Min-ordering and max-ordering scalarization methods for multi-objective robust optimization
- Multi-objective vehicle routing problems
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Optimization by simulated annealing
- Personnel scheduling: a literature review
- Problem difficulty for tabu search in job-shop scheduling
- Recent advances in robust optimization: an overview
- Rules for biologically inspired adaptive network design
- Some thoughts on combinatorial optimisation
- Statistical analysis of distance-based path relinking for the capacitated vehicle routing problem
- Tabu Search—Part I
- Testing heuristics: We have it all wrong
- The Benders decomposition algorithm: a literature review
- The design of approximation algorithms
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances
- Uncertainty principles and ideal atomic decomposition
- Variable neighborhood search
- Why is maximum clique often easy in practice?
Cited in
(3)
This page was built for publication: Research trends in combinatorial optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6091419)
