Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
type: Item
instance of: scholarly article
title: Symmetry breaking in mixed integer linear programming formulations for blocking two-level orthogonal experimental designs
zbMATH Open document ID: 1391.90684
author: Nha Vo-Thanh
author: Raf Jans
author: Eric Dick Schoen
author: P. Goos
published in: Computers \& Operations Research
publication date: 2018-07-11T00:00:00Z
full work available at URL: https://hdl.handle.net/10067/1519410151162165141
Mathematics Subject Classification ID: 90C90
Mathematics Subject Classification ID: 68M20
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6901640
zbMATH Keywords: asymmetric representatives formulation
zbMATH Keywords: confounding
zbMATH Keywords: symmetry breaking constraints
zbMATH Keywords: integer linear programing
zbMATH Keywords: orthogonal blocking
describes a project that uses: Orthogonal Array
MaRDI profile type: Publication
OpenAlex ID: W2795596766
cites work: Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
cites work: A comparison of integer and constraint programming models for the deficiency problem
cites work: New integer linear programming approaches for course timetabling
cites work: On the asymmetric representatives formulation for the vertex coloring problem
cites work: A class representative model for pure parsimony haplotyping
cites work: The exact solution of several classes of inventory-routing problems
cites work: Optimal Allocation of Surgery Blocks to Operating Rooms Under Uncertainty
cites work: Orthogonal arrays. Theory and applications
cites work: Solving lot-sizing problems on parallel identical machines using symmetry-breaking constraints
cites work: Analysis of an industrial component commonality problem
cites work: Efficient symmetry breaking formulations for the job grouping problem
cites work: Q5757147
cites work: Orbitopal fixing
cites work: Packing and partitioning orbitopes
cites work: Improving bounds on the football pool problem by integer programming and high-throughput computing
cites work: Pruning by isomorphism in branch-and-cut
cites work: Exploiting orbits in symmetric ILP
cites work: Symmetry in Integer Linear Programming
cites work: Modified orbital branching for structured symmetry with an application to unit commitment
cites work: Orbital branching
cites work: Complete enumeration of pure-level and mixed-level orthogonal arrays
cites work: Enhanced Model Formulations for Optimal Facility Layout
cites work: A tabu search algorithm for application placement in computer clustering
cites work: Q5191180
Wikidata QID: Q130025716
DOI: 10.1016/J.COR.2018.04.001
description: scientific article; zbMATH DE number 6901640