combinatorial optimization

On Modeling Local Search with Special-Purpose Combinatorial Optimization Hardware

  • Xiaoyuan Liu
  • Avradip Mandal
  • Arnab Roy
  • Ilya Safro
  • Sarvagya Upadhyay
  • Hayato Ushijima-Mwesigwa
    • Categories Combinatorial Optimization, Meta Heuristics Tags , , ,

    As we approach the physical limits predicted by Moore’s law, a variety of specialized hardware is emerging to tackle specialized tasks in different domains. Within combinatorial optimization, adiabatic quantum computers, CMOS annealers, and optical parametric oscillators are few of the emerging specialized hardware technology aimed at solving optimization problems. In terms of mathematical framework, the … Read more

    Exact solution of the donor-limited nearest neighbor hot deck imputation problem

  • Jan Pablo Burgard
  • Sven de Vries
  • Ulf Friedrich
  • Dennis Kreber
    • Categories Graphs and Matroids, Network Optimization, Statistics Tags , , , ,

    Data quality in population surveys suffers from missing responses. We use combinatorial optimization to create a complete and coherent data set. The methods are based on the widespread nearest neighbor hot deck imputation method that replaces the missing values with observed values from a close unit, the so-called donor. As a repeated use of donors … Read more

    Constraint Programming Approaches for the Discretizable Molecular Distance Geometry Problem

  • Merve Bodur
  • Moira MacNeil
    • Categories Applications - OR and Management Sciences, Combinatorial Optimization Tags , , , ,

    The Distance Geometry Problem (DGP) seeks to find positions for a set of points in geometric space when some distances between pairs of these points are known. The so-called discretization assumptions allow to discretize the search space of DGP instances. In this paper, we focus on a key subclass of DGP, namely the Discretizable Molecular … Read more

    Globalized Robust Optimization with Gamma-Uncertainties

  • Andreas Bärmann
  • Christina Büsing
  • Frauke Liers
    • Categories (Mixed) Integer Linear Programming, Combinatorial Optimization, Robust Optimization Tags , , ,

    Globalized robust optimization has been proposed as a generalization of the standard robust optimization framework in order to allow for a controlled decrease in protection depending on the distance of the realized scenario from the predefined uncertainty set. In this work, we specialize the notion of globalized robustness to Gamma-uncertainty in order to extend its … Read more

    A Tutorial on Formulating and Using QUBO Models

  • Yu Du
  • Fred Glover
  • Gary Kochenberger
    • Categories 0-1 Programming, Combinatorial Optimization Tags , ,

    The Quadratic Unconstrained Binary Optimization (QUBO) model has gained prominence in recent years with the discovery that it unifies a rich variety of combinatorial optimization problems. By its association with the Ising problem in physics, the QUBO model has emerged as an underpinning of the quantum computing area known as quantum annealing and has become … Read more

    A Tutorial on Formulating QUBO Models

  • Fred Glover
  • Gary Kochenberger
    • Categories 0-1 Programming, Combinatorial Optimization, Meta Heuristics Tags ,

    The field of Combinatorial Optimization (CO) is one of the most important areas in the general field of optimization, with important applications found in every industry, including both the private and public sectors. It is also one of the most active research areas pursued by the research communities of Operations Research, Computer Science, and Analytics … Read more

    Efficient heuristic algorithm for identifying critical nodes in planar networks

  • Gang Cui
  • Dalaijargal Purevusren
    • Categories Combinatorial Optimization, Network Optimization Tags , , , ,

    This paper presents a new method for identifying critical nodes in planar networks. We propose an efficient method to evaluate the quality of solutions by using special properties of planar networks. It enables us to develop a computationally efficient heuristic algorithm for the problem. The proposed algorithm assisted on randomly generated planar networks. The experimental … Read more

    Benders Decomposition for Very Large Scale Partial Set Covering and Maximal Covering Problems

  • Jean-François Cordeau
  • Fabio Furini
  • Ivana Ljubić
    • Categories Branch and Cut Algorithms, Combinatorial Optimization Tags , , , ,

    Covering problems constitute an important family of facility location problems. This paper intro- duces a new exact algorithm for two important members of this family: i) the maximal covering location problem, which requires finding a subset of facilities that maximizes the amount of demand covered while respecting a budget constraint on the cost of the … Read more

    A Branch-and-Benders-Cut Algorithm for the Road Restoration Crew Scheduling and Routing Problem

  • Douglas Alem
  • Pedro Munari
  • Alfredo Moreno
    • Categories Applications - OR and Management Sciences, Branch and Cut Algorithms, Cutting Plane Approaches Tags , , , ,

    Extreme events such as disasters cause partial or total disruption of basic services such as water, energy, communication and transportation. In particular, roads can be damaged or blocked by debris, thereby obstructing access to certain affected areas. Thus, restoration of the damaged roads is necessary to evacuate victims and distribute emergency commodities to relief centers … Read more

    The forwarder planning problem in a two-echelon network

  • Massimo Di Francesco
  • Manlio Gaudioso
  • Enrico Gorgone
  • Paola Zuddas
    • Categories Approximation Algorithms, Transportation Tags , ,

    This paper is motivated by the case of a forwarder in dealing with inland transportation planning from a seaport, where inbound containers from the sea are filled with pallets, which have different destinations in the landside. Although this forwarder does not have or control any vehicle, he is required to plan the assignment of containers … Read more