OR-Library

swMATH4153MaRDI QIDQ16337FDOQ16337

Author name not available (Why is that?)

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 tabu search algorithm for the periodic vehicle routing problem with multiple vehicle trips and accessibility restrictions
• A linear risk-return model for enhanced indexation in portfolio optimization
• A new formulation and resolution method for the \(p\)-center problem
• A note on equity across groups in facility location
• 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
• Parallel metaheuristics: recent advances and new trends
• Solving thep-Center problem with Tabu Search and Variable Neighborhood Search
• New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
• Large-scale local search heuristics for the capacitated vertexp-center problem
• Title not available (Why is that?)
• All-integer column generation for set partitioning: basic principles and extensions
• The quintile share ratio in location analysis
• New hard benchmark for flowshop scheduling problems minimising makespan
• A GRASP/path relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems
• Title not available (Why is that?)
• A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing
• Title not available (Why is that?)
• MIP models for connected facility location: a theoretical and computational study
• Title not available (Why is that?)
• Chance constrained \(0-1\) quadratic programs using copulas
• Data set generation for rectangular placement problems
• New classes of fast lower bounds for bin packing problems
• A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
• An efficient local search heuristic with row weighting for the unicost set covering problem
• A cutting plane algorithm for the capacitated facility location problem
• A facility location model for logistics systems including reverse flows: the case of remanufacturing activities
• On heuristic search for the single machine total weighted tardiness problem - Some theoretical insights and their empirical verification
• A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
• Double bound method for solving the \(p\)-center location problem
• A simple and effective iterated greedy algorithm for the permutation flowshop scheduling problem
• A branch-and-price algorithm for the capacitated facility location problem
• A multi-population hybrid biased random key genetic algorithm for hop-constrained trees in nonlinear cost flow networks
• RELAXATION HEURISTICS FOR THE SET COVERING PROBLEM(<Special Issue>the 50th Anniversary of the Operations Research Society of Japan)
• A branch-and-cut method for the obnoxious \(p\)-median problem
• Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
• Solving the hub location problem in a star–star network
• The multi-period incremental service facility location problem
• A multi-level search strategy for the 0-1 multidimensional knapsack problem
• A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation
• The gravity \(p\)-median model
• An efficient combined DCA and B\&B using DC/SDP relaxation for globally solving binary quadratic programs
• Improved algorithms for the Steiner problem in networks
• Scatter search and bionomic algorithms for the aircraft landing problem
• Convergence and computational analyses for some variable target value and subgradient deflection methods
• A GRASP algorithm to solve the unicost set covering problem
• An electromagnetism metaheuristic for the unicost set covering problem
• Heuristics for the 0-1 multidimensional knapsack problem
• Portfolio optimization with an envelope-based multi-objective evolutionary algorithm
• Enhancing an algorithm for set covering problems
• A genetic algorithm for the multidimensional knapsack problem
• A study of the quadratic semi-assignment polytope
• A hybrid optimization approach to index tracking
• A flexible model and efficient solution strategies for discrete location problems
• A new quasi-human algorithm for solving the packing problem of unit equilateral triangles
• A contribution to the stochastic flow shop scheduling problem.
• The multidimensional 0-1 knapsack problem: an overview.
• Local search for the Steiner tree problem in the Euclidean plane
• A comparison of discrete and continuous neural network approaches to solve the class/teacher timetabling problem.
• A second-order cone programming approach for linear programs with joint probabilistic constraints
• Deterministic job-shop scheduling: Past, present and future
• A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles
• A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• Improved core problem based heuristics for the 0/1 multi-dimensional knapsack problem
• A pure quasi-human algorithm for solving the cuboid packing problem
• MIP modeling of incremental connected facility location
• Extensions to the generalised assignment heuristic for vehicle routing
• A multi-objective memetic algorithm for the job-shop scheduling problem
• A caving degree approach for the single container loading problem
• Solving the hub location problem with modular link capacities
• Metaheuristics: A bibliography
• Accelerating column generation for variable sized bin-packing problems
• Local search with perturbations for the prize-collecting Steiner tree problem in graphs
• An exact algorithm for the capacitated vertex \(p\)-center problem
• Exact solution of the two-dimensional finite bin packing problem
• Combining very large scale and ILP based neighborhoods for a two-level location problem
• A set-covering-based heuristic approach for bin-packing problems
• A hybrid genetic algorithm for the two-dimensional single large object placement problem
• An improved ant colony optimization for vehicle routing problem
• Airport runway scheduling
• Integrated production and material handling scheduling using mathematical programming and constraint programming
• An exact method for the vehicle routing problem with backhauls
• Optimizing over the split closure
• The \(p\)-median problem under uncertainty
• Comparison of heuristics for flowtime minimisation in permutation flowshops
• A modified variable neighborhood search for the discrete ordered median problem
• Load balancing and capacity constraints in a hierarchical location model
• Efficient solution of large scale, single-source, capacitated plant location problems
• Variable neighborhood search for minimum sum-of-squares clustering on networks
• A completely positive representation of \(0\)-\(1\) linear programs with joint probabilistic constraints
• Heuristic and exact algorithms for scheduling aircraft landings
• Fast bounding procedures for large instances of the simple plant location problem
• A simulated annealing code for general integer linear programs
• A sparse enhanced indexation model with chance and cardinality constraints
• Title not available (Why is that?)
• An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space

This page was built for software: OR-Library