Sciweavers

716 search results - page 9 / 144
» Semilinear Program Feasibility
Sort
View
COR
2008
99views more  COR 2008»
13 years 11 months ago
Repairing MIP infeasibility through local branching
Finding a feasible solution to a generic Mixed-Integer Program (MIP) is often a very difficult task. Recently, two heuristic approaches called Feasibility Pump and Local Branching...
Matteo Fischetti, Andrea Lodi
TOOLS
1998
IEEE
14 years 3 months ago
C++ Program Information Database for Analysis Tools
Program information extracted from source codes is valuable for research in many software engineering fields. Many program analysis tools in these fields usually share some common...
Wanghong Yuan, X. Chen, Tao Xie, Hong Mei, Fuqing ...
ASP
2005
Springer
14 years 4 months ago
Applications of Preferences using Answer Set Programming
Preferences are useful when the space of feasible solutions of a given problem is dense but not all these solutions are equivalent w.r.t. some additional requirements. In this case...
Claudia Zepeda, Mauricio Osorio, Juan Carlos Nieve...
ISSTA
2006
ACM
14 years 4 months ago
Run-time detection of potential deadlocks for programs with locks, semaphores, and condition variables
Concurrent programs are notorious for containing errors that are difficult to reproduce and diagnose. A common kind of concurrency error is deadlock, which occurs when some thread...
Rahul Agarwal, Scott D. Stoller
EOR
2007
111views more  EOR 2007»
13 years 10 months ago
Linear programming based algorithms for preemptive and non-preemptive RCPSP
: In this paper, the RCPSP (Resource Constrained Project Scheduling Problem) is solved using a linear programming model. Each activity may or may not be preemptive. Each variable i...
Jean Damay, Alain Quilliot, Eric Sanlaville