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)

An integer programming approach to generating airline crew pairings
On a posterior evaluation of a simple greedy method for set packing
COLE: a new heuristic approach for fixed charge problem computational results
Graph theoretic relaxations of set covering and set partitioning problems
New variants of the simple plant location problem and applications
A concurrent processing framework for the set partitioning problem
Order batching in walk-and-pick order picking systems
Pseudo-Boolean optimization
Facility location models for distribution system design
A set packing model for the ground holding problem in congested networks
A combined Lagrangian, linear programming, and implication heuristic for large-scale set partitioning problems
Dual inequalities for stabilized column generation revisited
Survivability in hierarchical telecommunications networks
An algorithm for the planar three-index assignment problem
Rounding to an integral program
VERY STRONGLY CONSTRAINED PROBLEMS: AN ANT COLONY OPTIMIZATION APPROACH
Efficient solutions for special zero-one programming problems
Irregular polyomino tiling via integer programming with application in phased array antenna design
Covering arrays via set covers
A tutorial on branch and cut algorithms for the maximum stable set problem
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
An extension of set partitioning with application to scheduling problems
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
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
A branch-and-cut algorithm for the maximum cardinality stable set problem
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
Discrete extremal problems
Strategic design of distribution systems with economies of scale in transportation
Adjacency on combinatorial polyhedra
Algorithms for large scale set covering problems
An exact algorithm for the vehicle routing problem based on the set partitioning formulation with additional cuts
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\(\}\)
Modeling the parallel machine scheduling problem with step deteriorating jobs
The column subtraction algorithm: An exact method for solving weighted set covering, packing and partitioning problems
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 unified approach to approximating partial covering problems
Valid inequalities and facets of the capacitated plant location problem
A districting procedure for social organizations
Ideal polytopes and face structures of some combinatorial optimization problems
A new modeling and solution approach for the set-partitioning problem
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
Solving the anti-covering location problem using Lagrangian relaxation
Airline crew scheduling: state-of-the-art
A branch-and-cut algorithm for partition coloring
A dual ascent procedure for the set partitioning problem
The simple plant location problem: Survey and synthesis
Modeling profit sharing in combinatorial exchanges by network flows
A novel modeling approach for express package carrier planning
An exact algorithm based on cut-and-column generation for the capacitated location-routing 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
Heuristics and their design: A survey
Hyperbolic set covering problems with competing ground-set elements
Tighter representations for set partitioning problems
Aggregation of constraints in integer programming
A branch-and-price algorithm for solving the Hamiltonian \(p\)-median problem
Modelling transfer line design problem via a set partitioning problem
Some classes of valid inequalities and convex hull characterizations for dynamic fixed-charge problems under nested constraints
Some facets of the simple plant location polytope
Approximation algorithms for scheduling parallel machines with an energy constraint in green manufacturing
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
A new lifting theorem for vertex packing
Transitive packing
Easy and difficult exact covering problems arising in VLSI power reduction by clock gating
A matheuristic for the cell formation problem
Combination of local search and CLP in the vehicle-fleet scheduling problem
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
Primal-dual approximation algorithms for submodular cost set cover problems with linear/submodular penalties
On the mixed set covering, packing and partitioning polytope
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
Improving set partitioning problem solutions by zooming around an improving direction
A modeling framework for incorporating DEA efficiency into set covering, packing, and partitioning formulations
Optimal Dorfman group testing for symmetric distributions
Limited memory rank-1 cuts for vehicle routing problems
Experiments with the ``Oregon Trail knapsack problem
An effective structured approach to finding optimal partitions of networks
An information-theoretic framework for the lossy compression of link streams
Valid Inequalities and Separation Algorithms for the Set Partitioning Problem
On optimal flip-flop grouping for VLSI power minimization
Experiments with parallel branch-and-bound algorithms for the set covering problem
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 approximation algorithm for \(P\)-prize-collecting set cover problem
Efficient heuristics for a partial set covering problem with mutually exclusive pairs of facilities
On the complete set packing and set partitioning polytopes: properties and rank 1 facets

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)