2725 search results - page 224 / 545 » Constraint Solving for Interpolation |
157
click to vote
INFORMS
2010
15 years 4 months ago
2010
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
216
click to vote
JCO
2011
14 years 10 months ago
2011
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
295
click to vote
ICICIC
2006
IEEE
16 years 1 months ago
2006
IEEE
In timetable scheduling problems, examination subjects must be slotted to certain times that satisfy several of constraints. They are NP-completeness problems, which usually lead ...
190
click to vote
COCOON
2005
Springer
16 years 22 days ago
2005
Springer
Abstract. In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem under weighted Hamming distance with bound constraints, wh...
191
click to vote
CP
2005
Springer
16 years 22 days ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...