The following pages link to Peter J. Stuckey (Q264991):
Displaying 50 items.
- A complete refinement procedure for regular separability of context-free languages (Q264992) (← links)
- (Q429803) (redirect page) (← links)
- MDD propagators with explanation (Q429805) (← links)
- Exploiting subproblem dominance in constraint programming (Q453591) (← links)
- (Q487658) (redirect page) (← links)
- Search combinators (Q487659) (← links)
- CP and IP approaches to cancer radiotherapy delivery optimization (Q538316) (← links)
- Philosophy of the MiniZinc challenge (Q606904) (← links)
- Explaining the \texttt{cumulative} propagator (Q647477) (← links)
- Lock-free parallel dynamic programming (Q666192) (← links)
- Bottom-up evaluation and query optimization of well-founded models (Q673130) (← links)
- CLP\(({\mathfrak R})\) and some electrical engineering problems (Q688564) (← links)
- Projecting CLP(\({\mathcal R}\)) constraints (Q688823) (← links)
- Fourier elimination for compiling constraint hierarchies (Q698090) (← links)
- Propagating systems of dense linear integer constraints (Q842789) (← links)
- The design of the zinc modelling language (Q941812) (← links)
- Semantics of infinite tree logic programming (Q1090469) (← links)
- Foundations of aggregation constraints (Q1127534) (← links)
- Transforming normal logic programs to constraint logic programs (Q1200979) (← links)
- (Q1405331) (redirect page) (← links)
- Removing node overlapping in graph layout using constrained optimization (Q1405333) (← links)
- Improving linear constraint propagation by changing constraint representation (Q1405334) (← links)
- (Q1589463) (redirect page) (← links)
- A Lagrangian reconstruction of GENET (Q1589464) (← links)
- Propagating \textsc{lex}, \textsc{find} and \textsc{replace} with dashed strings (Q1626699) (← links)
- Solver independent rotating workforce scheduling (Q1626767) (← links)
- Breaking symmetries with lex implications (Q1648885) (← links)
- Exploiting sparsity in difference-bound matrices (Q1664386) (← links)
- A Benders decomposition approach to deciding modular linear integer arithmetic (Q1680266) (← links)
- Using constraint programming for solving RCPSP/MAX-cal (Q1699524) (← links)
- Mixed-integer linear programming and constraint programming formulations for solving resource availability cost problems (Q1754108) (← links)
- A complete solution to the maximum density still life problem (Q1761276) (← links)
- Negation and constraint logic programming (Q1891129) (← links)
- On inductive inference of cyclic structures (Q1924733) (← links)
- Range-consistent forbidden regions of Allen's relations (Q2011570) (← links)
- Minimizing landscape resistance for habitat conservation (Q2011583) (← links)
- Dashed strings for string constraint solving (Q2046015) (← links)
- Pairwise symmetry reasoning for multi-agent path finding search (Q2060696) (← links)
- Fast optimal and bounded suboptimal Euclidean pathfinding (Q2060748) (← links)
- Core-guided and core-boosted search for CP (Q2110407) (← links)
- Robust resource planning for aircraft ground operations (Q2110409) (← links)
- Algorithm selection for dynamic symbolic execution: a preliminary study (Q2119113) (← links)
- Branch-and-cut-and-price for multi-agent path finding (Q2147092) (← links)
- Branch-and-cut-and-price for the electric vehicle routing problem with time windows, piecewise-linear recharging and capacitated recharging stations (Q2147168) (← links)
- Constraint programming for high school timetabling: a scheduling-based model with hot starts (Q2150593) (← links)
- Context-sensitive dynamic partial order reduction (Q2151268) (← links)
- Coupling different integer encodings for SAT (Q2170178) (← links)
- A FastMap-based algorithm for block modeling (Q2170199) (← links)
- Enumerated types and type extensions for MiniZinc (Q2170216) (← links)
- Nutmeg: a MIP and CP hybrid solver using branch-and-check (Q2226478) (← links)
