Set Partitioning: A survey

Programming involving graphs or networks (90C35) Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Integer programming (90C10) Lattice packing and covering (number-theoretic aspects) (11H31)

Cited in

(only showing first 100 items - show all)

Some facets of the simple plant location polytope
An integer programming approach to generating airline crew pairings
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
On a posterior evaluation of a simple greedy method for set packing
A new lifting theorem for vertex packing
Graph theoretic relaxations of set covering and set partitioning problems
COLE: a new heuristic approach for fixed charge problem computational results
A concurrent processing framework for the set partitioning problem
New variants of the simple plant location problem and applications
Transitive packing
Order batching in walk-and-pick order picking systems
Pseudo-Boolean optimization
Facility location models for distribution system design
Easy and difficult exact covering problems arising in VLSI power reduction by clock gating
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
A set packing model for the ground holding problem in congested networks
Dual inequalities for stabilized column generation revisited
A matheuristic for the cell formation problem
Rounding to an integral program
An algorithm for the planar three-index assignment problem
Survivability in hierarchical telecommunications networks
Efficient solutions for special zero-one programming problems
VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
Combination of local search and CLP in the vehicle-fleet scheduling problem
Irregular polyomino tiling via integer programming with application in phased array antenna design
Covering arrays via set covers
Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
General cut-generating procedures for the stable set polytope
On the multisource hyperplanes location problem to fitting set of points
Separating lifted odd-hole inequalities to solve the index selection problem
A constraint programming approach to extract the maximum number of non-overlapping test forms
Facets of the three-index assignment polytope
A tutorial on branch and cut algorithms for the maximum stable set problem
An extension of set partitioning with application to scheduling problems
Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
On the mixed set covering, packing and partitioning polytope
On the resolution and optimization of a system of fuzzy relational equations with sup-\(T\) composition
Minimizing a linear fractional function subject to a system of sup-\(T\) equations with a continuous Archimedean triangular norm
Using dual network bounds in algorithms for solving generalized set packing/partitioning problems
A column generation approach to the coalition formation problem in multi-agent systems
The Boolean quadratic polytope: Some characteristics, facets and relatives
A branch-and-cut algorithm for a traveling salesman problem with pickup and delivery
Complementary column generation and bounding approaches for set partitioning formulations
Network models for vehicle and crew scheduling
Implicit enumeration algorithms for the set-partitioning problem
Set partitioning mit linearen Randbedingungen
\(K_ i\)-covers. I: Complexity and polytopes
Improving set partitioning problem solutions by zooming around an improving direction
Discrete extremal problems
Strategic design of distribution systems with economies of scale in transportation
A branch-and-cut algorithm for the maximum cardinality stable set problem
Algorithms for large scale set covering problems
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
Adjacency on combinatorial polyhedra
Limited memory rank-1 cuts for vehicle routing problems
A modeling framework for incorporating DEA efficiency into set covering, packing, and partitioning formulations
Optimal Dorfman group testing for symmetric distributions
Modeling the parallel machine scheduling problem with step deteriorating jobs
On the 0,1 facets of the set covering polytope
On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
Experiments with the ``Oregon Trail knapsack problem
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
An effective structured approach to finding optimal partitions of networks
A unified approach to approximating partial covering problems
Valid inequalities and facets of the capacitated plant location problem
A comparison of two methods for solving 0-1 integer programs using a general purpose simulated annealing algorithm
The stochastic transportation problem with single sourcing
A districting procedure for social organizations
Ideal polytopes and face structures of some combinatorial optimization problems
Lagrangean relaxation for a lower bound to a set partitioning problem with side constraints: Properties and algorithms
A branch-and-cut algorithm for the pallet loading problem
A new modeling and solution approach for the set-partitioning problem
Solving the anti-covering location problem using Lagrangian relaxation
Airline crew scheduling: state-of-the-art
An information-theoretic framework for the lossy compression of link streams
A dual ascent procedure for the set partitioning problem
On optimal flip-flop grouping for VLSI power minimization
A branch-and-cut algorithm for partition coloring
The simple plant location problem: Survey and synthesis
Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
Experiments with parallel branch-and-bound algorithms for the set covering problem
Modeling profit sharing in combinatorial exchanges by network flows
A novel modeling approach for express package carrier planning
Rank-Cluster-and-Prune: An algorithm for generating clusters in complex set partitioning problems
The matching relaxation for a class of generalized set partitioning problems
An exact algorithm based on cut-and-column generation for the capacitated location-routing problem
An approximation algorithm for \(P\)-prize-collecting set cover problem
A branch-and-cut algorithm for a generalization of the uncapacitated facility location problem
Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
Facets and algorithms for capacitated lot sizing
Hyperbolic set covering problems with competing ground-set elements
Heuristics and their design: A survey
Tighter representations for set partitioning problems
Aggregation of constraints in integer programming
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Modelling transfer line design problem via a set partitioning problem
On the complete set packing and set partitioning polytopes: properties and rank 1 facets
A branch-and-price algorithm for solving the Hamiltonian \(p\)-median problem
Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities

This page was built for publication: Set Partitioning: A survey

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4117604)