Abstract is missing.
- Preference Elicitation and Preference Learning in Social ChoiceCraig Boutilier. 1 [doi]
- Propagation in Constraints: How One Thing Leads to AnotherIan P. Gent. 2 [doi]
- On Bilevel Programming and Its Impact in Branching, Cutting and ComplexityAndrea Lodi. 3 [doi]
- Optimization Methods for the Partner Units ProblemMarkus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob, Peter Jeavons, Anna Ryabokon, Evgenij Thorstensen. 4-19 [doi]
- Manipulating MDD Relaxations for Combinatorial OptimizationDavid Bergman, Willem Jan van Hoeve, John N. Hooker. 20-35 [doi]
- The AllDifferent Constraint with PrecedencesChristian Bessiere, Nina Narodytska, Claude-Guy Quimper, Toby Walsh. 36-52 [doi]
- Retail Store Workforce Scheduling by Expected Operating Income MaximizationNicolas Chapados, Marc Joliveau, Louis-Martin Rousseau. 53-58 [doi]
- Spatial and Objective Decompositions for Very Large SCAPsCarleton Coffrin, Pascal Van Hentenryck, Russell Bent. 59-75 [doi]
- Upgrading Shortest Paths in NetworksBistra N. Dilkina, Katherine J. Lai, Carla P. Gomes. 76-91 [doi]
- Parallel Machine Scheduling with Additional Resources: A Lagrangian-Based Constraint Programming ApproachEmrah B. Edis, Ceyda Oguz. 92-98 [doi]
- Branch-Cut-and-Propagate for the Maximum ::::k::::-Colorable Subgraph Problem with SymmetryTim Januschowski, Marc E. Pfetsch. 99-116 [doi]
- Climbing Depth-Bounded Adjacent Discrepancy Search for Solving Hybrid Flow Shop Scheduling Problems with Multiprocessor TasksAsma Lahimer, Pierre Lopez, Mohamed Haouari. 117-130 [doi]
- On Counting Lattice Points and Chvátal-Gomory Cutting PlanesAndrea Lodi, Gilles Pesant, Louis-Martin Rousseau. 131-136 [doi]
- Precedence Constraint Posting for Cyclic Scheduling ProblemsMichele Lombardi, Alessio Bonfietti, Michela Milano, Luca Benini. 137-153 [doi]
- A Probing Algorithm for MINLP with Failure Prediction by SVMGiacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, François Margot, Andreas Wächter. 154-169 [doi]
- Recovering Indirect Solution Densities for Counting-Based Branching HeuristicsGilles Pesant, Alessandro Zanarini. 170-175 [doi]
- Using Hard Constraints for Representing Soft ConstraintsJean-Charles Régin. 176-189 [doi]
- The Objective Sum ConstraintJean-Charles Régin, Thierry Petit. 190-195 [doi]
- Almost Square PackingHelmut Simonis, Barry O Sullivan. 196-209 [doi]
- Efficient Planning of Substation Automation System CablesThanikesavan Sivanthi, Jan Poland. 210-214 [doi]
- A New Algorithm for Linear and Integer Feasibility in Horn ConstraintsK. Subramani, James Worthington. 215-229 [doi]
- Timetable Edge Finding Filtering Algorithm for Discrete Cumulative ResourcesPetr Vilím. 230-245 [doi]
- Identifying Patterns in Sequences of VariablesAlessandro Zanarini, Pascal Van Hentenryck. 246-251 [doi]