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)

• MIRPLib -- a library of maritime inventory routing problem instances: survey, core model, and benchmark results
• A perturbation heuristic for a class of location problems
• Metaheuristic applications on discrete facility location problems: a survey
• Optimization of job shop scheduling problems using teaching-learning-based optimization algorithm
• Solving the \(p\)-hub median problem under intentional disruptions using simulated annealing
• On Dantzig-Wolfe Decomposition in Integer Programming and ways to Perform Branching in a Branch-and-Price Algorithm
• GASUB: finding global optima to discrete location problems by a genetic-like algorithm
• PackLib\(^{2}\): an integrated library of multi-dimensional packing problems
• Hub location-allocation in intermodal logistic networks
• Problem difficulty for tabu search in job-shop scheduling
• A simple tabu search for warehouse location
• Solving the uncapacitated hub location problem using genetic algorithms
• New simple and efficient heuristics for the uncapacitated single allocation hub location problem
• A hybrid multistart heuristic for the uncapacitated facility location problem
• On statistical bounds of heuristic solutions to location problems
• The \(p\)-median problem: a survey of metaheuristic approaches
• Algorithms for the set covering problem
• Variable neighborhood search: Principles and applications
• An effective and simple heuristic for the set covering problem
• Title not available (Why is that?)
• A tabu search approach to the uncapacitated facility location problem
• Exact and heuristic algorithms for the uncapacitated multiple allocation \(p\)-hub median problem
• Stabilized column generation
• Optimal location with equitable loads
• Preprocessing and cutting for multiple allocation hub location problems.
• A column generation approach to capacitated \(p\)-median problems
• Minimizing conditional-value-at-risk for stochastic scheduling problems
• Octane: A New Heuristic for Pure 0–1 Programs
• Computational experience with approximation algorithms for the set covering problem
• Exact solution of bin-packing problems using column generation and branch-and-bound
• An evolutionary heuristic for the index tracking problem.
• A global continuation algorithm for solving binary quadratic programming problems
• Generalized coverage: new developments in covering location models
• Lagrangean heuristics for location problems
• Strong lower bounds for the prize collecting Steiner problem in graphs
• Computational study of large-scale \(p\)-median problems
• Branch-and-cut approaches for chance-constrained formulations of reliable network design problems
• A genetic algorithm for the vehicle routing problem
• The stochastic \(p\)-hub center problem with service-level constraints
• MIP reformulations of the probabilistic set covering problem
• Complementary column generation and bounding approaches for set partitioning formulations
• A set covering based matheuristic for a real-world city logistics problem
• A statistical analysis of simulated annealing applied to the \(p\)-median problem
• Variable neighborhood search for metric dimension and minimal doubly resolving set problems
• Mixed-integer programming approaches for index tracking and enhanced indexation
• A tighter formulation of the \(p\)-median problem
• Title not available (Why is that?)
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case
• A scatter search heuristic for the capacitated clustering problem
• Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem
• Upper and lower bounds for the single source capacitated location problem.
• The capacitated multiple allocation hub location problem: Formulations and algorithms
• Comparison of bundle and classical column generation
• A fast swap-based local search procedure for location problems
• Solving the uncapacitated facility location problem using tabu search
• A hybrid heuristic for the diameter constrained minimum spanning tree problem
• MineLib: a library of open pit mining problems
• A hierarchical model for the location of perinatal facilities in the municipality of Rio de Janeiro
• A bi-objective model for the single-machine scheduling problem with rejection cost and total tardiness minimization
• Separation algorithms for 0-1 knapsack polytopes
• A new Integer Linear Program for the Steiner Tree Problem with Revenues, Budget and Hop Constraints
• A branch and cut algorithm for hub location problems with single assignment
• Measuring instance difficulty for combinatorial optimization problems
• A simple but usually fast branch-and-bound algorithm for the capacitated facility location problem
• An algorithm for ranking assignments using reoptimization
• Heuristic algorithms for the cardinality constrained efficient frontier
• A population heuristic for constrained two-dimensional non-guillotine cutting
• Routing problems: A bibliography
• A new approximation algorithm for the \(k\)-facility location problem
• A new method for mean-variance portfolio optimization with cardinality constraints
• Cardinal: a finite sets constraint solver
• Solving Max-cut to optimality by intersecting semidefinite and polyhedral relaxations
• Column generation extensions of set covering greedy heuristics
• A survey of effective heuristics and their application to a variety of knapsack problems
• A binary differential search algorithm for the 0-1 multidimensional knapsack problem
• A defensive maximal covering problem on a network
• A Sample Approximation Approach for Optimization with Probabilistic Constraints
• Benchmarks for basic scheduling problems
• New convergent heuristics for 0-1 mixed integer programming
• Solution approaches for the capacitated single allocation hub location problem using ant colony optimisation
• Reduced costs propagation in an efficient implicit enumeration for the 01 multidimensional knapsack problem
• A genetic algorithm for the \(p\)-median problem with pos/neg weights
• Fast heuristics for the Steiner tree problem with revenues, budget and hop constraints
• The two-dimensional bin packing problem with variable bin sizes and costs
• A strengthened formulation for the simple plant location problem with order
• The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
• Chance-Constrained Binary Packing Problems
• Mixed 0-1 Programming by Lift-and-Project in a Branch-and-Cut Framework
• A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
• BPPLIB: a library for bin packing and cutting stock problems
• Big segment small segment global optimization algorithm on networks
• An efficient genetic algorithm for the \(p\)-median problem
• MIPLIB 2017: data-driven compilation of the 6th mixed-integer programming library
• 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

This page was built for software: OR-Library