The Polytope of Context-Free Grammar Constraints

DOI10.1007/978-3-642-01929-6_17MaRDI QIDQ3630164zbMATH OpenOpenAlexFDO

Authors Gilles Pesant, Claude-Guy Quimper, Louis-Martin Rousseau, Meinolf Sellmann

Publication date 3 June 2009

Published in Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-01929-6_17

zbMATH Keywords

grammar constraintspolytope

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Deterministic scheduling theory in operations research (90B35) Combinatorial optimization (90C27)

Recommendations

• Decomposing Global Grammar Constraints
• Grammar-based integer programming models for multi-activity shift scheduling
• Grammar-based integer programming models for multiactivity shift scheduling
• Reformulating Global Grammar Constraints
• The Theory of Grammar Constraints

Cited in

(8)

• A geometric hierarchy beyond context-free languages
• Orbital shrinking: theory and applications
• A context-free grammar for the \(e\)-positivity of the trivariate second-order Eulerian polynomials
• Grammar constraints
• scientific article; zbMATH DE number 5855004 (Why is no real title available?)
• Branch-and-price for personalized multiactivity tour scheduling
• The Theory of Grammar Constraints
• scientific article; zbMATH DE number 7559421 (Why is no real title available?)

This page was built for publication: The Polytope of Context-Free Grammar Constraints

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