• Home
  • Search
  • Portfolio Approaches for Constraint Optimization Problems
  • Cite Icon25
  • https://doi.org/10.1007/978-3-319-09584-4_3Copy DOI Icon

Portfolio Approaches for Constraint Optimization Problems

  • Jan 1, 2014
  • Roberto Amadini +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Within the Constraints Satisfaction Problems (CSP) context, a methodology that has proven to be particularly performant consists in using a portfolio of different constraint solvers. Nevertheless, comparatively few studies and investigations have been done in the world of Constraint Optimization Problems (COP). In this work, we provide a generalization to COP as well as an empirical evaluation of different state of the art existing CSP portfolio approaches properly adapted to deal with COP. Experimental results confirm the effectiveness of portfolios even in the optimization field, and could give rise to some interesting future research.

Similar Papers
  • Research Article
  • Citations11

An Iterative local-search framework for solving constraint satisfaction problem

  • Jan 05, 2008
  • Applied Soft Computing Journal
  • Mohamed Tounsi +1
  • Conference Article
  • Citations8

Optimizing Constraint Solving via Dynamic Programming

  • Aug 01, 2019
  • Shu Lin +2
  • Research Article
  • Citations2

Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems

  • Feb 16, 2012
  • Journal of Mathematical Modelling and Algorithms
  • Marie-José Huguet +2
  • Conference Article
  • Citations1

Constraint Solving and Optimization Using Evolutionary Techniques

  • Aug 01, 2019
  • Mahdi Bidar +1
  • Research Article
  • Citations71

A hybrid Constraint Programming/Mixed Integer Programming framework for the preventive signaling maintenance crew scheduling problem

  • Aug 31, 2017
  • European Journal of Operational Research
  • Shahrzad M Pour +4
  • Research Article
  • Citations3

A learning Portfolio solver for optimizing the performance of constraint programming problems on multi‐core computing systems

  • Apr 27, 2016
  • Concurrency and Computation: Practice and Experience
  • Tarek Menouer +2
  • Research Article
  • Citations146

Compiling finite linear CSP into SAT

  • Dec 24, 2008
  • Constraints
  • Naoyuki Tamura +3
  • Book Chapter
  • Citations44

Compiling Finite Linear CSP into SAT

  • Jan 01, 2006
  • Naoyuki Tamura +3
  • Conference Article
  • Citations6

Time Complexity of Constraint Satisfaction via Universal Algebra

  • Jan 01, 2020
  • Peter Jönsson +2
  • Conference Article
  • Citations1

Successive search method for valued constraint satisfaction and optimization problems

  • Nov 07, 2001
  • M Tounsi +1
  • Book Chapter
  • Citations2

Autonomous Search in Constraint Satisfaction via Black Hole: A Performance Evaluation Using Different Choice Functions

  • Jan 01, 2016
  • Ricardo Soto +4
  • Research Article
  • Citations150

Probe Backtrack Search for Minimal Perturbation in DynamicScheduling

  • Jan 01, 2000
  • Constraints
  • Hani El Sakkout +1
  • Research Article
  • Citations9

Global Constraints in Distributed Constraint Satisfaction and Optimization

  • Aug 30, 2013
  • The Computer Journal
  • C Bessiere +3
  • Research Article
  • Citations21

Discovering Archipelagos of Tractability for Constraint Satisfaction and Counting

  • Mar 06, 2017
  • ACM Transactions on Algorithms
  • Robert Ganian +2
  • Research Article
  • Citations2

Solving constraint satisfaction and optimization problems by a neuro-fuzzy approach

  • Jan 01, 1999
  • IEEE Transactions on Systems, Man and Cybernetics, Part B (Cybernetics)
  • S Cavalieri +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.