In this paper, a combinatorial auction problem is modeled as a NP-complete set packing problem and a Lagrangian relaxation based heuristic algorithm is proposed. Extensive experim...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Jiqing T...
This paperpresents new resultson anapproach for solvingsatisfiability problems (SAT), that is, creating a logic circuit that is specialized to solve each problem instance on Field ...
This article describes and compares three heuristics for a variant of the Steiner tree problem with revenues, which includes budget and hop constraints. First, a greedy method whi...
The vehicle routing problems with time windows are challenging delivery problems in which instances involving 100 customers or more can be difficult to solve. There were many inter...
This study investigates an optimization-based heuristic for the Robotic Cell Problem. This problem arises in automated cells and is a complex ow shop problem with a single transpo...
Jacques Carlier, Mohamed Haouari, Mohamed Kharbech...