Author:
Aron Ionuţ,Hooker John N.,Yunes Tallys H.
Publisher
Springer Berlin Heidelberg
Reference38 articles.
1. Balas, E.: Disjunctive programming: Properties of the convex hull of feasible points. Discrete Applied Mathematics 89, 3–44 (1998)
2. Baptiste, P., Le Pape, C., Nuijten, W.: Constraint-Based Scheduling. Kluwer, Dordrecht (2001)
3. Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik 4, 238–252 (1962)
4. Beringer, H., de Backer, B.: Combinatorial problem solving in constraint logic programming with cooperating solvers. In: Beierle, C., Plümer, L. (eds.) Logic Programming: Formal Methods and Practical Applications, Elsevier Science, Amsterdam (1995)
5. Berkelaar, M.: LP_SOLVE, Available from
ftp://ftp.ics.ele.tue.nl/pub/lp_solve/
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. An algorithm-independent measure of progress for linear constraint propagation;Constraints;2022-10-12
2. Local Rapid Learning for Integer Programs;Integration of Constraint Programming, Artificial Intelligence, and Operations Research;2019
3. Constraint programming and operations research;Constraints;2017-12-29
4. Arc Consistency via Linear Programming;Lecture Notes in Computer Science;2017
5. Mixed Integer Programming vs. Logic-Based Benders Decomposition for Planning and Scheduling;Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems;2013