Problems of discrete optimization: challenges and main approaches to solve them (Q2371716): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Complexity of discrete multicriteria problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2773682 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4740328 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using a model of cellular automata and classification methods for prediction of time series with memory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3340546 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3664785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4692345 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4745600 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4880741 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3875693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Existence of solutions in vector optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3968763 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Restart technology for solving discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization parallelizing for discrete programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Problems of discrete optimization: challenges and main approaches to solve them / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The method of global equilibrium search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Results of an experimental investigation of the efficiency of the global-equilibrium-search method / rank
 
Normal rank
Property / cites work
 
Property / cites work: New lower bounds of the size of error-correcting codes for the \(Z\)-channel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4339078 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided Local Search with Shifting Bottleneck for Job Shop Scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic aspects in speech recognition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local search with memory: Benchmarking RTS / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Reactive Tabu Search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2776548 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4490845 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The <i>N</i>-City Travelling Salesman Problem: Statistical Mechanics and the Metropolis Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4398361 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for extremal graphs. I: The AutoGraphiX system / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(bc\)-\(opt\): A branch-and-cut code for mixed integer programs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of smoothing heuristics for the traveling salesman problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy randomized adaptive search procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounding the probability of success of stochastic methods for global optimization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ant colonies for the quadratic assignment problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Insertion and Postoptimization Procedures for the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3935744 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu Search—Part II / rank
 
Normal rank
Property / cites work
 
Property / cites work: A block approach for single-machine scheduling with release dates and due dates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of large-scale symmetric travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search for the p-median / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood decomposition search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4079017 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ``Neural'' computation of decisions in optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4840772 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithmic Approach to Network Location Problems. II: The<i>p</i>-Medians / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4144785 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Heuristic Procedure for Partitioning Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computer Solutions of the Traveling Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An evolutionary heuristic for quadratic 0-1 programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy and local search heuristics for unconstrained binary quadratic programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Variable neighborhood search / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Fast Taboo Search Algorithm for the Job Shop Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part I, Graph Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350034 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multistart tabu search strategies for the unconstrained binary quadratic optimization problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The maximum clique problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search method guided by shifting bottleneck for the job shop scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4495496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization by GRASP / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search procedure for the \(p\)-median problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving vehicle routing problems using constraint programming and metaheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stability and Regularization of Vector Problems of Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast local search and guided local search and their application to British Telecom's workforce scheduling problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Job Shop Scheduling by Simulated Annealing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une approche hybride pour le sac à dos multidimensionnel en variables 0–1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guided local search and its application to the traveling salesman problem / rank
 
Normal rank

Latest revision as of 11:14, 26 June 2024

scientific article
Language Label Description Also known as
English
Problems of discrete optimization: challenges and main approaches to solve them
scientific article

    Statements

    Problems of discrete optimization: challenges and main approaches to solve them (English)
    0 references
    0 references
    5 July 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    discrete optimization
    0 references
    decrease-vector method
    0 references
    method of global equilibrium search
    0 references
    metaheuristics
    0 references
    computational experiment
    0 references
    algorithm efficiency
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references