Orbital branching

From MaRDI portal
Revision as of 08:16, 30 January 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:623461

DOI10.1007/S10107-009-0273-XzbMath1206.90101OpenAlexW2914080086MaRDI QIDQ623461

Fabrizio Rossi, Stefano Smriglio, James Ostrowski, Jeff Linderoth

Publication date: 14 February 2011

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-009-0273-x




Related Items (45)

Detecting almost symmetries of graphsExploiting symmetries in mathematical programming via orbital independenceAlgorithms and Software for Convex Mixed Integer Nonlinear ProgramsIncremental network design with shortest pathsA specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-spaceOptimal booking and scheduling in outpatient procedure centersReduction of orbits of finite Coxeter groups of non-crystallographic typeOrbital Independence in Symmetric Mathematical ProgramsSymmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designsEquivalence of Lattice Orbit PolytopesPolytopes associated with symmetry handlingUsing stochastic programming to solve an outpatient appointment scheduling problem with random service and arrival timesHandling symmetries in mixed-integer semidefinite programsOptimizing edge sets in networks to produce ground truth communities based on modularityOptimization for Power Systems and the Smart GridOrbitopal fixingA Combinatorial Approach for Small and Strong Formulations of Disjunctive ConstraintsSymmetry-breaking inequalities for ILP with structured sub-symmetryAlgorithms for highly symmetric linear and integer programsAn efficient global algorithm for indefinite separable quadratic knapsack problems with box constraintsDomain reduction techniques for global NLP and MINLP optimizationA fast global algorithm for singly linearly constrained separable binary quadratic program with partially identical parametersA semidefinite relaxation based global algorithm for two-level graph partition problemAn exact approach for the multi-constraint graph partitioning problemExploiting symmetry in integer convex optimization using core pointsOptimization Bounds from the Branching DualLarge-scale unit commitment under uncertainty: an updated literature surveyOrbitopal fixing for the full (sub-)orbitope and application to the unit commitment problemUsing symmetry to optimize over the Sherali-Adams relaxationStabilizer-based symmetry breaking constraints for mathematical programsA computational comparison of symmetry handling methods for mixed integer programsBranch-and-bound algorithms: a survey of recent advances in searching, branching, and pruningMathematical optimization approaches for facility layout problems: the state-of-the-art and future research directionsSolving large Steiner Triple Covering ProblemsOrbital shrinking: theory and applicationsOn solving a hard quadratic 3-dimensional assignment problemOn the geometry of symmetry breaking inequalitiesOn the geometry of symmetry breaking inequalitiesInsight into the computation of Steiner minimal trees in Euclidean space of general dimensionAnalysis of models for the stochastic outpatient procedure scheduling problemExploiting Symmetries in Polyhedral ComputationsFundamental Domains for Symmetric Optimization: Construction and SearchModified orbital branching for structured symmetry with an application to unit commitmentPolitical districting to minimize cut edgesClassical symmetries and the quantum approximate optimization algorithm


Uses Software



Cites Work




This page was built for publication: Orbital branching