A new modeling and solution approach for the set-partitioning problem

Authors:
Mark Lewis;Gary Kochenberger;Bahram Alidaee
Affiliations:
School of Professional Studies, Missouri Western State University, St. Joseph, MO;School of Business, University of Colorado, Denver, CO;School of Business, University of Mississippi, University, MS
Venue:
Computers and Operations Research
Year:
2008

Citing 9
Cited 3

Solving airline crew scheduling problems by branch-and-cut

Management Science
Adaptive Memory Tabu Search for Binary Quadratic Programs

Management Science
Solving Large Airline Crew Scheduling Problems: Random Pairing Generation and Strong Branching

Computational Optimization and Applications
Constraint Handling in Genetic Algorithms: The Set Partitioning Problem

Journal of Heuristics
A Set-Partitioning-Based Heuristic for the Vehicle Routing Problem

INFORMS Journal on Computing
Grasp and Path Relinking for 2-Layer Straight Line Crossing Minimization

INFORMS Journal on Computing
A Parallel, Linear Programming-based Heuristic for Large-Scale Set Partitioning Problems

INFORMS Journal on Computing
Dynamic Aggregation of Set-Partitioning Constraints in Column Generation

Operations Research
Using xQx to model and solve the uncapacitated task allocation problem

Operations Research Letters

Fast two-flip move evaluations for binary unconstrained quadratic optimisation problems

International Journal of Metaheuristics
Backbone guided tabu search for solving the UBQP problem

Journal of Heuristics
A hybrid metaheuristic for multiobjective unconstrained binary quadratic programming

Applied Soft Computing

Quantified Score

Hi-index	0.01

Visualization

Abstract

The set-partitioning problem (SPP) is widely known for both its application potential and its computational challenge. This NP-hard problem is known to pose considerable difficulty for classical solution methods such as those based on LP technologies. In recent years, the unconstrained binary quadratic program has proven to perform well as a unified modeling and solution framework for a variety of IP problems. In this paper we illustrate how this unified framework can be applied to SPP. Computational experience is presented, illustrating the attractiveness of the approach.