Conferences in DBLP
Andrew Eremin , Mark Wallace Hybrid Benders Decomposition Algorithms in Constraint Logic Programming. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:1-15 [Conf ] Erlendur S. Thorsteinsson Branch-and-Check: A Hybrid Framework Integrating Mixed Integer Programming and Constraint Logic Programming. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:16-30 [Conf ] Slim Abdennadher , Christophe Rigotti Towards Inductive Constraint Solving. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:31-45 [Conf ] Susan L. Epstein , Eugene C. Freuder Collaborative Learning for Constraint Solving. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:46-60 [Conf ] Thierry Benoist , Eric Bourreau , Yves Caseau , Benoît Rottembourg Towards Stochastic Constraint Programming: A Study of Online Multi-choice Knapsack with Deadlines. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:61-76 [Conf ] Filippo Focacci , Michela Milano Global Cut Framework for Removing Symmetries. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:77-92 [Conf ] Torsten Fahle , Stefan Schamberger , Meinolf Sellmann Symmetry Breaking. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:93-107 [Conf ] Olivier Dubois , Gilles Dequen The Non-existence of (3, 1, 2)-Conjugate Orthogonal Idempotent Latin Square of Order 10. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:108-120 [Conf ] Alfonso San Miguel Aguirre , Moshe Y. Vardi Random 3-SAT and BDDs: The Plot Thickens Further. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:121-136 [Conf ] Ramón Béjar , Alba Cabiscol , Cèsar Fernández , Felip Manyà , Carla P. Gomes Capturing Structure with Satisfiability. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:137-152 [Conf ] Weixiong Zhang Phase Transitions and Backbones of 3-SAT and Maximum 3-SAT. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:153-167 [Conf ] Nikos Mamoulis , Kostas Stergiou Solving Non-binary CSPs Using the Hidden Variable Encoding. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:168-182 [Conf ] Gilles Pesant A Filtering Algorithm for the Stretch Constraint. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:183-195 [Conf ] Alexander Bockmayr , Nicolai Pisaruk , Abderrahmane Aggoun Network Flow Problems in Constraint Programming. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:196-210 [Conf ] Nicolas Beldiceanu Pruning for the Minimum Constraint Family and for the Number of Distinct Values Constraint Family. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:211-224 [Conf ] Ian P. Gent , Robert W. Irving , David Manlove , Patrick Prosser , Barbara M. Smith A Constraint Programming Approach to the Stable Marriage Problem. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:225-239 [Conf ] Chiu Wo Choi , Martin Henz , Ka Boon Ng Components for State Restoration in Tree Search. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:240-255 [Conf ] Armin Wolf Adaptive Constraint Handling with CHR in Java. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:256-270 [Conf ] Marius-Calin Silaghi , Djamila Sam-Haroud , Boi Faltings Consistency Maintenance for ABT. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:271-285 [Conf ] Giorgio Delzanno , Tevfik Bultan Constraint-Based Verification of Client-Server Protocols. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:286-301 [Conf ] Catuscia Palamidessi , Frank D. Valencia A Temporal Concurrent Constraint Programming Calculus. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:302-316 [Conf ] Pedro Meseguer , Javier Larrosa , Martí Sánchez Lower Bounds for Non-binary Constraint Optimization Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:317-331 [Conf ] Jean-Charles Régin , Thierry Petit , Christian Bessière , Jean-Francois Puget New Lower Bounds of Constraint Violations for Over-Constrained Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:332-345 [Conf ] Rina Dechter , Kalev Kask , Javier Larrosa A General Scheme for Multiple Lower Bound Computation in Constraint Optimization. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:346-360 [Conf ] Kim Marriott , Peter Moulder , Peter J. Stuckey , Alan Borning Solving Disjunctive Constraints for Interactive Graphical Applications. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:361-376 [Conf ] Nicolas Beldiceanu , Mats Carlsson Sweep as a Generic Pruning Technique Applied to the Non-overlapping Rectangles Constraint. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:377-391 [Conf ] Nicolas Beldiceanu , Qi Guo , Sven Thiel Non-overlapping Constraints between Convex Polytopes. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:392-407 [Conf ] Hubie Chen , Carla P. Gomes , Bart Selman Formal Models of Heavy-Tailed Behavior in Combinatorial Search. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:408-421 [Conf ] Alessandro Armando , Felice Peccia , Silvio Ranise The Phase Transition of the Linear Inequalities Problem. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:422-432 [Conf ] Phokion G. Kolaitis , Thomas Raffill In Search of a Phase Transition in the AC-Matching Problem. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:433-450 [Conf ] Thierry Petit , Jean-Charles Régin , Christian Bessière Specific Filtering Algorithms for Over-Constrained Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:451-463 [Conf ] Pedro Meseguer , Martí Sánchez Specializing Russian Doll Search. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:464-478 [Conf ] Martin T. Swain , Graham J. L. Kemp A CLP Approach to the Protein Side-Chain Placement Problem. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:479-493 [Conf ] Rolf Backofen , Sebastian Will Fast, Constraint-Based Threading of HP-Sequences to Hydrophobic Cores. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:494-508 [Conf ] Martin Henz , Edgar Tan , Roland H. C. Yap One Flip per Clock Cycle. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:509-523 [Conf ] Claude Michel , Michel Rueher , Yahia Lebbah Solving Constraints over Floating-Point Numbers. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:524-538 [Conf ] Micha Janssen , Pascal Van Hentenryck , Yves Deville Optimal Pruning in Parametric Differential Equations. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:539-553 [Conf ] Francisco Azevedo , Pedro Barahona Interaction of Constraint Programming and Local Search for Optimisation Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:554-559 [Conf ] Hachemi Bennaceur , Mohamed-Salah Affane Partition-k-AC: An Efficient Filtering Technique Combining Domain Partition and Arc Consistency. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:560-564 [Conf ] Christian Bessière , Assef Chmeiss , Lakhdar Sais Neighborhood-Based Variable Ordering Heuristics for the Constraint Satisfaction Problem. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:565-569 [Conf ] Marco Cadoli The Expressive Power of Binary Linear Programming. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:570-574 [Conf ] Simon Colton , Ian Miguel Constraint Generation via Automated Theory Formation. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:575-579 [Conf ] Kelly Easton , George L. Nemhauser , Michael A. Trick The Traveling Tournament Problem Description and Benchmarks. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:580-584 [Conf ] Eugene C. Freuder , Chavalit Likitvivatanavong , Richard J. Wallace Deriving Explanations and Implications for Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:585-589 [Conf ] Eugene C. Freuder , Barry O'Sullivan Generating Tradeoffs for Interactive Constraint-Based Configuration. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:590-594 [Conf ] Rafael M. Gasca , Juan A. Ortega , Miguel Toro Structural Constraint-Based Modeling and Reasoning with Basic Configuration Cells. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:595-599 [Conf ] Laurent Granvilliers , Eric Monfroy Composition Operators for Constraint Propagation: An Application to Choco. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:600-604 [Conf ] Edward A. Hirsch , Arist Kojevnikov Solving Boolean Satisfiability Using Local Search Guided by Unit Clause Elimination. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:605-609 [Conf ] George Katsirelos , Fahiem Bacchus GAC on Conjunctions of Constraints. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:610-614 [Conf ] Barbara M. Smith Dual Models of Permutation Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:615-619 [Conf ] Christine Solnon Boosting Local Search with Artificial Ants. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:620-624 [Conf ] Peter van Beek , Kent D. Wilken Fast Optimal Instruction Scheduling for Single-Issue Processors with Arbitrary Latencies. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:625-639 [Conf ] Cecilia Ekelin , Jan Jonsson Evaluation of Search Heuristics for Embedded System Scheduling Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:640-654 [Conf ] Markus P. J. Fromherz , James V. Mahoney Interpreting Sloppy Stick Figures with Constraint-Based Subgraph Matching. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:655-669 [Conf ] Gérard Verfaillie , Michel Lemaître Selecting and Scheduling Observations for Agile Satellites: Some Lessons from the Constraint Reasoning Community Point of View. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:670-684 [Conf ] Pragnesh Jay Modi , Hyuckchul Jung , Milind Tambe , Wei-Min Shen , Shriniwas Kulkarni A Dynamic Distributed Constraint Satisfaction Approach to Resource Allocation. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:685-700 [Conf ] Juliette Mattioli , Nicolas Museux , Jean Jourdan , Pierre Savéant , Simon de Givry A Constraint Optimization Framework for Mapping a Digital Signal Processing Application onto a Parallel Architecture. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:701-715 [Conf ] Christos Voudouris , Raphaël Dorne , David Lesaint , Anne Liret iOpt: A Software Toolkit for Heuristic Search Methods. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:716-719 [Conf ] Sylvain Merchez , Christophe Lecoutre , Frédéric Boussemart AbsCon: A Prototype to Solve CSPs with Abstraction. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:730-744 [Conf ] József Váncza , András Márkus A Constraint Engine for Manufacturing Process Planning. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:745-759 [Conf ] Amy M. Beckwith , Berthe Y. Choueiry On the Dynamic Detection of Interchangeability in Finite Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:760- [Conf ] Lyndon Drake Automatic Generation of Implied Clauses for SAT. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:761- [Conf ] Fabio Fioravanti Verification of Infinite-State Systems by Specialization of CLP Programs. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:762- [Conf ] Marco Gavanelli Partially Ordered Constraint Optimization Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:763- [Conf ] Rosella Gennari Translations for Comparing Soft Frameworks. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:764- [Conf ] Mitchell A. Harris Counting Satisfiable k-CNF Formulas. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:765- [Conf ] Brahim Hnich High-Level Modelling and Reformulation of Constraint Satisfaction Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:766- [Conf ] Hyuckchul Jung Distributed Constraint Satisfaction as a Computational Model of Negotiation via Argumentation. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:767- [Conf ] Erik Kilborn Aircraft Assignment Using Constraint Programming. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:768- [Conf ] Zeynep Kiziltan Labelling Heuristics for CSP Application Domains. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:769- [Conf ] Inês Lynce , João P. Marques Silva Improving SAT Algorithms by Using Search Pruning Techniques. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:770- [Conf ] Iain McDonald Optimum Symmetry Breaking in CSPs Using Group Theory. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:771- [Conf ] Christian Bessière , Arnold Maestre , Pedro Meseguer Distributed Dynamic Backtracking. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:772- [Conf ] Pragnesh Jay Modi Constraint Programming for Distributed Resource Allocation. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:773- [Conf ] Nicoleta Neagu Exploiting the CSP Structure by Interchangeability. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:774- [Conf ] Andrea Panati Constraint Processing Techniques for Model-Based Reasoning about Dynamic Systems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:776- [Conf ] Georg Ringwelski Distributed Constraint Satisfaction with Cooperating Asynchronous Solvers. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:777- [Conf ] Louis-Martin Rousseau , Gilles Pesant , Michel Gendreau Building Negative Reduced Cost Paths Using Constraint Programming. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:778- [Conf ] Miguel A. Salido , Federico Barber An Incremental and Non-binary CSP Solver: The Hyperpolyhedron Search Algorithm. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:779- [Conf ] Sibylle Schwarz Partial Stable Generated Models of Generalized Logic Programs with Constraints. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:781- [Conf ] Frank Seelisch Heterogeneous Constraint Problems. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:783- [Conf ] Daniel Sheridan Comparing SAT Encodings for Model Checking. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:784- [Conf ] Marius-Calin Silaghi , Stefan Sabau , Djamila Sam-Haroud , Boi Faltings Asynchronous Search for Numeric DisCSPs. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:785- [Conf ] Frank D. Valencia Temporal Concurrent Constraint Programming. [Citation Graph (0, 0)][DBLP ] CP, 2001, pp:786- [Conf ]