Problems of discrete optimization: challenges and main approaches to solve them
From MaRDI portal
Publication:2371716
DOI10.1007/s10559-006-0086-3zbMath1119.90001OpenAlexW2068054555MaRDI QIDQ2371716
Publication date: 5 July 2007
Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10559-006-0086-3
metaheuristicsdiscrete optimizationcomputational experimentalgorithm efficiencydecrease-vector methodmethod of global equilibrium search
Integer programming (90C10) Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02)
Related Items
Problems of discrete optimization: challenges and main approaches to solve them, Bilevel optimization problems of distribution of interbudgetary transfers under given limitations, Teams of global equilibrium search algorithms for solving the weighted maximum cut problem in parallel, Kernel technology to solve discrete optimization problems, Solving the maxcut problem by the global equilibrium search, Solving weighted MAX-SAT via global equilibrium search, Global equilibrium search applied to the unconstrained binary quadratic optimization problem, LP-oriented upper bounds for the weighted stability number of a graph
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Optimization by Simulated Annealing
- Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Solution of large-scale symmetric travelling salesman problems
- ``Neural computation of decisions in optimization problems
- A block approach for single-machine scheduling with release dates and due dates
- A genetic algorithm for the multidimensional knapsack problem
- An efficient tabu search procedure for the \(p\)-median problem
- The maximum clique problem
- Fast local search and guided local search and their application to British Telecom's workforce scheduling problem
- Variable neighborhood search
- New lower bounds of the size of error-correcting codes for the \(Z\)-channel
- A computational study of smoothing heuristics for the traveling salesman problem
- Optimization parallelizing for discrete programming problems
- Bounding the probability of success of stochastic methods for global optimization
- Greedy randomized adaptive search procedures
- Guided local search and its application to the traveling salesman problem
- An evolutionary heuristic for quadratic 0-1 programming
- Variable neighborhood decomposition search
- Greedy and local search heuristics for unconstrained binary quadratic programming
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Local search with memory: Benchmarking RTS
- \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs
- The method of global equilibrium search
- A tabu search method guided by shifting bottleneck for the job shop scheduling problem
- Variable neighborhood search for extremal graphs. I: The AutoGraphiX system
- Results of an experimental investigation of the efficiency of the global-equilibrium-search method
- Problems of discrete optimization: challenges and main approaches to solve them
- Using a model of cellular automata and classification methods for prediction of time series with memory
- Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
- Ant colonies for the quadratic assignment problem
- Optimization by GRASP
- The N-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning
- An Algorithmic Approach to Network Location Problems. II: Thep-Medians
- Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
- Job Shop Scheduling by Simulated Annealing
- Tabu Search—Part I
- Tabu Search—Part II
- New Insertion and Postoptimization Procedures for the Traveling Salesman Problem
- An Efficient Heuristic Procedure for Partitioning Graphs
- Variable neighborhood search for the p-median
- The Reactive Tabu Search
- A Fast Taboo Search Algorithm for the Job Shop Problem
- Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
- Une approche hybride pour le sac à dos multidimensionnel en variables 0–1
- Stability and Regularization of Vector Problems of Integer Linear Programming
- Complexity of discrete multicriteria problems
- Algorithmic aspects in speech recognition
- Computer Solutions of the Traveling Salesman Problem
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- A branch and bound algorithm for the maximum clique problem
- Restart technology for solving discrete optimization problems
- Existence of solutions in vector optimization problems
- Solving vehicle routing problems using constraint programming and metaheuristics
- Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
