COMET

swMATH3051MaRDI QIDQ15584FDOQ15584

Author name not available (Why is that?)

Described by source

• Parallel and distributed local search in COMET

Cited In (74)

• \textsc{Tor}: modular search with hookable disjunction
• Revisiting the Soft Global Cardinality Constraint
• A tight analysis of the Katriel-Bodlaender algorithm for online topological ordering
• A branch‐and‐price approach to k‐clustering minimum biclique completion problem
• MILP, Pseudo-Boolean, and OMT Solvers for Optimal Fault-Tolerant Placements of Relay Nodes in Mission Critical Wireless Networks*
• An automaton Constraint for Local Search
• Hybrids of Constructive Metaheuristics and Constraint Programming: A Case Study with ACO
• Leprechauns on the chessboard
• Modeling with metaconstraints and semantic typing of variables
• Title not available (Why is that?)
• Constraint-based Diversification of JOP Gadgets
• Preprocessing Expression-Based Constraint Satisfaction Problems for Stochastic Local Search
• Distributed Constraint-Based Local Search
• ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms
• Visual search tree profiling
• \(\text{ECL}^{\text{i}}\text{PS}^{\text{e}}\) -- from LP to CLP
• MiniCP: a lightweight solver for constraint programming
• Spatial and Objective Decompositions for Very Large SCAPs
• A simple and deterministic competitive algorithm for online facility location
• Combining two pheromone structures for solving the car sequencing problem with ant colony optimization
• A GRASP approach for the extended car sequencing problem
• Global constraint catalogue: past, present and future
• An overview of Ciao and its design philosophy
• Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs
• Title not available (Why is that?)
• Parallel Local Search in Comet
• Constraint-Based Local Search for Constrained Optimum Paths Problems
• Monadic constraint programming
• Challenges in Enterprise Wide Optimization for the Process Industries
• Contraint-based combinators for local search
• Solving the maximum edge disjoint path problem using a modified Lagrangian particle swarm optimisation hybrid
• Algorithms and Data Structures
• Constraint programming-based column generation
• The weighted grammar constraint
• Metaheuristics—the metaphor exposed
• A review of literature on parallel constraint solving
• Revisiting constraint-directed search
• An integrated search heuristic for large-scale flexible job shop scheduling problems
• MIP neighborhood synthesis through semantic feature extraction and automatic algorithm configuration
• The design of the zinc modelling language
• Large neighborhood improvements for solving car sequencing problems
• A constraint-based local search backend for MiniZinc
• Constraint Programming and Local Search Hybrids
• Space and time allocation in a shipyard assembly hall
• Combining mixed integer programming and constraint programming to solve the integrated scheduling problem of container handling operations of a single vessel
• Model-driven visualizations of constraint-based local search
• Dantzig-Wolfe decomposition and branch-and-price solving in G12
• AllDifferent-based filtering for subgraph isomorphism
• Contractor programming
• The car sequencing problem: overview of state-of-the-art methods and industrial case-study of the ROADEF'2005 challenge problem
• Large-scale parallelism for constraint-based local search: the costas array case study
• Bounding, filtering and diversification in CP-based local branching
• LocalSolver 1.x: A black-box local-search solver for 0-1 programming
• LS(graph): a constraint-based local search for constraint optimization on trees and paths
• Search combinators
• Solving weighted CSPs with meta-constraints by reformulation into satisfiability modulo theories
• Integrating operations research in constraint programming
• Nondeterministic control for hybrid search
• Maintaining longest paths incrementally
• Constraint propagation as information maximization
• Generic incremental algorithms for local search
• Constraint programming-based column generation
• Transparent parallelization of constraint programming
• Two local search approaches for solving real-life car sequencing problems
• Title not available (Why is that?)
• Solving scheduling problems from high-level models
• MiningZinc: a declarative framework for constraint-based mining
• A microkernel architecture for constraint programming
• Integrating operations research in constraint programming
• Strong Combination of Ant Colony Optimization with Constraint Programming Optimization
• Control abstractions for local search
• Inferring Variable Conflicts for Local Search
• Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
• Principles and Practice of Constraint Programming – CP 2004

This page was built for software: COMET