Set Partitioning: A survey

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

Cited in

(only showing first 100 items - show all)

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

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)