swMATH4153MaRDI QIDQ16337FDOQ16337
Author name not available (Why is that?)
Official website: http://people.brunel.ac.uk/~mastjjb/jeb/info.html
Cited In (only showing first 100 items - show all)
- A comparison of Lagrangean and surrogate relaxations for the maximal covering location problem
- A parallel genetic algorithm to solve the set-covering problem
- On the separation of disjunctive cuts
- Dynamic problem structure analysis as a basis for constraint-directed scheduling heuristics
- A heuristic algorithm for resource allocation/reallocation problem
- An exact solution method for unconstrained quadratic 0--1 programming: a geometric approach
- A new ant colony optimization algorithm for the multidimensional Knapsack problem
- A heuristic algorithm for the set covering problem
- Quotient geometric crossovers and redundant encodings
- An optimality cut for mixed integer linear programs
- Checkerboard pattern: proposals for its generation
- A neural model for the \(p\)-median problem
- A hybrid genetic algorithm for the multidimensional knapsack problem
- A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
- Coloured Petri net scheduling models: Timed state space exploration shortages
- A branch-and-bound algorithm for concave network flow problems
- A dynamic programming approach for solving single-source uncapacitated concave minimum cost network flow problems
- Ant colony optimisation with parameterised search space for the job shop scheduling problem
- Solving the Hub location problem in telecommunication network design: A local search approach
- Separating lifted odd-hole inequalities to solve the index selection problem
- Exemplar-based clustering via simulated annealing
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A family of facets for the uncapacitated \(p\)-median polytope
- Formulation and algorithms for the robust maximal covering location problem
- Multiple colony ant algorithm for job-shop scheduling problem
- Exploiting process plan flexibility in production scheduling: A multi-objective approach
- Upgrading edges in the maximal covering location problem
- Global equilibrium search applied to the unconstrained binary quadratic optimization problem
- Greedy and local search heuristics for unconstrained binary quadratic programming
- A capacitated hub location problem under hose demand uncertainty
- A Lagrangian search method for the \(P\)-median problem
- Robust min-max regret covering problems
- Omni-optimizer
- Heuristic solutions for general concave minimum cost network flow problems
- Exact algorithms for the two-dimensional guillotine knapsack
- Scatter search for the 0-1 multidimensional knapsack problem
- Accelerating the convergence of subgradient optimisation
- An iterative variable-based fixation heuristic for the 0-1 multidimensional knapsack problem
- A parallel interior point method and its application to facility location problems
- An acceleration of Erlenkotter-Körkel's algorithms for the uncapacitated facility location problem
- Stochastic single-allocation hub location
- A probabilistic greedy search algorithm for combinatorial optimisation with application to the set covering problem
- Lagrangean/surrogate relaxation for generalized assignment problems
- Facility location and capacity acquisition: An integrated approach
- Location and layout planning. A survey
- Genetic algorithms for the bus driver scheduling problem: a case study
- Metaheuristics for the portfolio selection problem
- On scheduling a single machine to minimize a piecewise linear objective function: A compact MIP formulation
- A leader-follower model for discrete competitive facility location
- A study on local search neighborhoods for the job shop scheduling problem with total weighted tardiness objective
- Shifting bottleneck scheduling for total weighted tardiness minimization -- a computational evaluation of subproblem and re-optimization heuristics
- Parallel-identical-machine job-shop scheduling with different stage-dependent buffering requirements
- New reformulations of distributionally robust shortest path problem
- Finding a cluster of points and the grey pattern quadratic assignment problem
- Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions
- Enhancing local search algorithms for job shops with MIN-sum objectives by approximate move evaluation
- A theoretical and empirical investigation on the Lagrangian capacities of the \(0\)-\(1\) multidimensional knapsack problem
- The three-dimensional knapsack problem with balancing constraints
- The maximin gradual cover location problem
- A Combinatorial Characterization of Higher-Dimensional Orthogonal Packing
- Experiments with LAGRASP heuristic for set \(k\)-covering
- Cutting planes in integer and mixed integer programming
- Erratum to ``An algorithm for ranking assignments using reoptimization [Computers \& Operations Research 35 (2008) 3714-3726]
- A tabu search heuristic for the Steiner Tree Problem
- The multidimensional 0-1 knapsack problem -- bounds and computational aspects
- Depth-first heuristic search for the job shop scheduling problem
- On a hybrid genetic algorithm for solving the container loading problem with no orientation constraints
- Binary accelerated particle swarm algorithm (BAPSA) for discrete optimization problems
- Evolutionary Computation in Combinatorial Optimization
- Title not available (Why is that?)
- An efficient heuristic algorithm for the capacitated \(p\)-median problem
- A Modified Binary Particle Swarm Optimization for Knapsack Problems
- Integrating heuristic information into exact methods: the case of the vertex \(p\)-centre problem
- A new heuristic algorithm for cuboids packing with no orientation constraints
- The multiple server center location problem
- On solving the Lagrangian dual of integer programs via an incremental approach
- MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
- GASUB: finding global optima to discrete location problems by a genetic-like algorithm
- PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
- CAGE
- Hyperheuristics
- iOpt
- Isolde
- MALLBA
- Microlay
- Title not available (Why is that?)
- Packlib2
- QAPLIB
- GRASP
- SPG
- TSPACK
- TSPLIB
- PERL
- VRPH
- PALS
- CLAIRE
- RAMP
- J-MEANS
- EVE-OPT
- MOTGA
This page was built for software: OR-Library
