Mathematical Research Data Initiative
Main page
Recent changes
Random page
SPARQL
MaRDI@GitHub
New item
Special pages
In other projects
MaRDI portal item
Discussion
View source
View history
English
Log in

Polytope of two at-least predicates

From MaRDI portal
Publication:5224725
Jump to:navigation, search

zbMATH Open1422.90026MaRDI QIDQ5224725FDOQ5224725


Authors: Niko Kaso, Serge G. Kruk Edit this on Wikidata


Publication date: 24 July 2019





Recommendations

  • Representations of the all\_different predicate of constraint satisfaction in integer programming
  • Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
  • On the system of the multiple all different predicates
  • The role of integer programming techniques in constraint programming's global constraints
  • On the facets of the multiple alldifferent constraint


zbMATH Keywords

convex hullnumber of facetsat-least


Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)







This page was built for publication: Polytope of two at-least predicates

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:5224725&oldid=19834891"
Tools
What links here
Related changes
Printable version
Permanent link
Page information
This page was last edited on 8 February 2024, at 18:08. Warning: Page may not contain recent updates.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki