Search
Search Results
-
KBO Constraint Solving Revisited
KBO constraint solving is very well-known to be an NP-complete problem. Motivated by the needs of the family of SCL calculi, we consider the...
-
Ant Colony Optimization for solving Directed Chinese Postman Problem
The Chinese Postman Problem (CPP) is a well-known optimization problem involving determining the shortest route, modeling the system as an undirected...
-
Solving the Car Sequencing Problem with Cross-Ratio Constraints Using Constraint Programming Approach
The rise of mass-individualization has underscored the significance of Mixed-Model Assembly Lines (MMALs) for producing diverse products on the same...
-
New discrete-time zeroing neural network for solving time-dependent linear equation with boundary constraint
Recently, continuous- and discrete-time models of a zeroing neural network (ZNN) have been developed to provide online solutions for the...
-
HSJ-Solver: a new method based on GHD for answering conjunctive queries and solving constraint satisfaction problems
Evaluating conjunctive queries (CQs) is NP-hard in general; however, acyclic CQs or nearest acyclic CQs can be evaluated in polynomial time. Many...
-
RAMP experiments in solving the uncapacitated facility location problem
In this paper, we consider three Relaxation Adaptive Memory Programming (RAMP) approaches for solving the Uncapacitated Facility Location Problem...
-
An overview of machine learning techniques in constraint solving
Constraint solving is applied in different application contexts. Examples thereof are the configuration of complex products and services, the...
-
Theorem Proving as Constraint Solving with Coherent Logic
In contrast to common automated theorem proving approaches, in which the search space is a set of some formulae and what is sought is again a (goal)...
-
Analysis of Coordination Mechanisms during Collaborative Problem-Solving on an Interactive Tabletop Display
Coordination is an important aspect of group work. Previous studies have shown how collocated multi-user interfaces, such as interactive tabletops,...
-
MBVS: a modified binary vortex search algorithm for solving uncapacitated facility location problem
Vortex search (VS) algorithm is a recently proposed swarm intelligence or evolutionary algorithm for solving continuous optimization problems...
-
Solving the kidney exchange problem via graph neural networks with no supervision
This paper introduces a new learning-based approach for approximately solving the Kidney-Exchange Problem (KEP), an NP-hard problem on graphs. The...
-
Interpreting NMR Spectra by Constraint Solving
Nuclear Magnetic Resonance (NMR) spectroscopy is a widely used analytical technique for identifying the molecular structure of complex organic...
-
Non-blind constraint image deblurring problem with mean curvature functional
Most of the time, while deblurring an image, we need the restored image’s intensities to be precisely non-negative. However, it has been noted that...
-
A collection of Constraint Programming models for the three-dimensional stable matching problem with cyclic preferences
We introduce five constraint models for the 3-dimensional stable matching problem with cyclic preferences and study their relative performances under...
-
The Complexity of the Distributed Constraint Satisfaction Problem
We study the complexity of the Distributed Constraint Satisfaction Problem (DCSP) on a synchronous, anonymous network from a theoretical standpoint....
-
Best of Both Worlds: Solving the Cyclic Bandwidth Problem by Combining Pre-existing Knowledge and Constraint Programming Techniques
Given an optimization problem, combining knowledge from both (i) structural or algorithmic known results and (ii) new solving techniques, helps gain...
-
Solving the uncapacitated facility location problem under uncertainty: a hybrid tabu search with path-relinking simheuristic approach
The uncapacitated facility location problem (UFLP) is a well-known combinatorial optimization problem that finds practical applications in several...
-
A new constraint programming model and solving for the cyclic hoist scheduling problem
The cyclic hoist scheduling problem (CHSP) is a well-studied optimisation problem due to its importance in industry. Despite the wide range of...
-
A 0–1 knapsack problem-based approach for solving open-pit mining problem with type-2 fuzzy parameters
Open-pit mining has several non-deterministic polynomial-time hard (NP-hard) 0–1 knapsack problems. The complexities of these problems are also...
