OR-Library

swMATH4153MaRDI QIDQ16337FDOQ16337

Author name not available (Why is that?)

Official website: http://people.brunel.ac.uk/~mastjjb/jeb/info.html

Described by source

• A note on solving large p-median problems

Cited In (only showing first 100 items - show all)

• Adaptive memory search for multidemand multidimensional knapsack problems
• A linear risk-return model for enhanced indexation in portfolio optimization
• BEAMR: an exact and approximate model for the \(p\)-median problem
• A cutting plane method for knapsack polytope
• Cutting plane versus compact formulations for uncertain (integer) linear programs
• Robust branch-cut-and-price for the capacitated minimum spanning tree problem over a large extended formulation
• An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem
• A local-search-based heuristic for the demand-constrained multidimensional knapsack problem
• Using extra dual cuts to accelerate column generation
• An inexact bundle approach to cutting-stock problems
• Solving the \(p\)-median problem with pos/neg weights by variable neighborhood search and some results for special cases
• Solution bias in ant colony optimisation: Lessons for selecting pheromone models
• Generating applicable synthetic instances for branch problems
• A computational study for the \(p\)-median problem
• A hybrid GRASP with perturbations for the Steiner problem in graphs
• Exactly solving a two-level location problem with modular node capacities
• New exact algorithms for one-machine earliness-tardiness scheduling
• Time-indexed formulations and the total weighted tardiness problem
• An interactive method for 0-1 multiobjective problems using simulated annealing and tabu search
• Dual-Optimal Inequalities for Stabilized Column Generation
• Particle swarm optimization and differential evolution for the single machine total weighted tardiness problem
• Feature Article—Genetic Algorithms for the Operations Researcher
• A Set Partitioning Approach to the Crew Scheduling Problem
• An indirect genetic algorithm for set covering problems
• Displacement problem and dynamically scheduling aircraft landings
• Title not available (Why is that?)
• Title not available (Why is that?)
• A formulation space search heuristic for packing unequal circles in a fixed size circular container
• Advanced greedy randomized adaptive search procedure for the obnoxious \(p\)-median problem
• \(p\)-facility Huff location problem on networks
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• A compact linearisation of Euclidean single allocation hub location problems
• Lower bounding procedures for the single allocation hub location problem
• A grouping genetic algorithm with controlled gene transmission for the bin packing problem
• A large neighbourhood based heuristic for two-echelon routing problems
• Branch-and-price algorithms for the two-echelon capacitated vehicle routing problem
• An exact approach for single machine subproblems in shifting bottleneck procedures for job shops with total weighted tardiness objective
• Title not available (Why is that?)
• Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints
• An implementation of exact knapsack separation
• Fast pattern-based algorithms for cutting stock
• Local search heuristics for the mobile facility location problem
• Variable neighborhood search for the pharmacy duty scheduling problem
• Weighted tardiness for the single machine scheduling problem:an examination of precedence theorem productivity
• Solving the job-shop scheduling problem optimally by dynamic programming
• The robust set covering problem with interval data
• Recoverable robust knapsacks: the discrete scenario case
• A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations
• New heuristics for one-dimensional bin-packing
• Improved convergent heuristics for the 0-1 multidimensional knapsack problem
• On operators and search space topology in multi-objective flow shop scheduling
• New bin packing fast lower bounds
• Exact and heuristic algorithms for the interval data robust assignment problem
• Multistart tabu search strategies for the unconstrained binary quadratic optimization problem
• A hybrid optimization approach to index tracking
• A flexible model and efficient solution strategies for discrete location problems
• A multi-objective iterated greedy search for flowshop scheduling with makespan and flowtime criteria
• Performance of simulated annealing-based heuristic for the unconstrained binary quadratic programming problem
• Enhancements to two exact algorithms for solving the vertex \(P\)-center problem
• A tabu search algorithm for the single machine total weighted tardiness problem
• Using a mixed integer quadratic programming solver for the unconstrained quadratic \(0-1\) problem
• An effective VNS for the capacitated \(p\)-median problem
• A proposal for a hybrid meta-strategy for combinatorial optimization problems
• Interval-indexed formulation based heuristics for single machine total weighted tardiness problem
• New relaxation-based algorithms for the optimal solution of the continuous and discrete \(p\)-center problems
• A computational study of exact knapsack separation for the generalized assignment problem
• Parallel machine earliness/tardiness scheduling problem under the effects of position based learning and linear/nonlinear deterioration
• Using rank-1 lift-and-project closures to generate cuts for 0-1 MIPs, a computational investigation
• On the equivalence of the Max-min transportation lower bound and the time-indexed lower bound for single-machine scheduling problems
• A computational evaluation of a general branch-and-price framework for capacitated network location problems
• A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
• Effective algorithm and heuristic for the generalized assignment problem.
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
• An in-out approach to disjunctive optimization
• MIP modeling of incremental connected facility location
• Extensions to the generalised assignment heuristic for vehicle routing
• Metaheuristics: A bibliography
• A comparative study of formulations and solution methods for the discrete ordered \(p\)-median problem
• Efficient heuristics for flowshop sequencing with the objectives of makespan and flowtime minimisation
• A visual interactive approach to vehicle routing
• Algorithms and codes for dense assignment problems: The state of the art
• A modified variable neighborhood search for the discrete ordered median problem
• Variable neighborhood search for minimum sum-of-squares clustering on networks
• A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
• 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

This page was built for software: OR-Library