咨询与建议

限定检索结果

文献类型

  • 1,018 篇 期刊文献
  • 814 篇 会议
  • 22 篇 学位论文

馆藏范围

  • 1,854 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 1,595 篇 工学
    • 1,324 篇 计算机科学与技术...
    • 486 篇 软件工程
    • 177 篇 电气工程
    • 136 篇 控制科学与工程
    • 134 篇 机械工程
    • 55 篇 信息与通信工程
    • 50 篇 土木工程
    • 39 篇 交通运输工程
    • 37 篇 建筑学
    • 15 篇 化学工程与技术
    • 15 篇 石油与天然气工程
    • 15 篇 航空宇航科学与技...
    • 14 篇 材料科学与工程(可...
    • 11 篇 力学(可授工学、理...
    • 11 篇 生物工程
    • 10 篇 仪器科学与技术
    • 10 篇 电子科学与技术(可...
    • 9 篇 动力工程及工程热...
  • 614 篇 管理学
    • 595 篇 管理科学与工程(可...
    • 118 篇 工商管理
    • 12 篇 图书情报与档案管...
  • 481 篇 理学
    • 358 篇 数学
    • 166 篇 系统科学
    • 31 篇 生物学
    • 17 篇 物理学
    • 6 篇 统计学(可授理学、...
  • 78 篇 经济学
    • 65 篇 应用经济学
    • 14 篇 理论经济学
  • 15 篇 医学
    • 8 篇 基础医学(可授医学...
  • 8 篇 法学
  • 8 篇 教育学
    • 6 篇 教育学
  • 8 篇 农学
  • 4 篇 艺术学
  • 2 篇 文学
  • 1 篇 哲学
  • 1 篇 历史学

主题

  • 1,854 篇 constraint progr...
  • 174 篇 scheduling
  • 84 篇 optimization
  • 65 篇 integer programm...
  • 42 篇 combinatorial op...
  • 39 篇 mixed integer pr...
  • 35 篇 local search
  • 35 篇 integer linear p...
  • 29 篇 constraint satis...
  • 28 篇 mathematical pro...
  • 28 篇 machine learning
  • 25 篇 mixed integer li...
  • 23 篇 linear programmi...
  • 23 篇 column generatio...
  • 22 篇 large neighborho...
  • 22 篇 mixed-integer pr...
  • 22 篇 planning
  • 22 篇 global constrain...
  • 22 篇 constraint propa...
  • 20 篇 search

机构

  • 24 篇 pontificia univ ...
  • 13 篇 univ autonoma ch...
  • 13 篇 univ st andrews ...
  • 12 篇 univ toronto dep...
  • 11 篇 univ san sebasti...
  • 10 篇 univ cient sur l...
  • 9 篇 univ bologna dei...
  • 9 篇 brown univ provi...
  • 8 篇 univ tehran coll...
  • 8 篇 univ cent chile ...
  • 7 篇 carnegie mellon ...
  • 7 篇 univ playa ancha...
  • 7 篇 natl univ irelan...
  • 7 篇 univ valparaiso ...
  • 7 篇 new mexico state...
  • 6 篇 katholieke univ ...
  • 6 篇 natl yunlin univ...
  • 6 篇 univ nantes lina...
  • 6 篇 natl univ irelan...
  • 6 篇 hacettepe univ d...

作者

  • 30 篇 crawford broderi...
  • 28 篇 beck j. christop...
  • 26 篇 stuckey peter j.
  • 24 篇 monfroy eric
  • 23 篇 soto ricardo
  • 23 篇 schaus pierre
  • 21 篇 rousseau louis-m...
  • 20 篇 milano michela
  • 18 篇 van hentenryck p...
  • 17 篇 lombardi michele
  • 17 篇 o'sullivan barry
  • 16 篇 miguel ian
  • 14 篇 wallace mark
  • 14 篇 hofstedt petra
  • 14 篇 guns tias
  • 13 篇 castro carlos
  • 13 篇 loudni samir
  • 12 篇 boizumault patri...
  • 12 篇 nightingale pete...
  • 12 篇 nijssen siegfrie...

语言

  • 1,741 篇 英文
  • 86 篇 其他
  • 12 篇 中文
  • 6 篇 法文
  • 2 篇 土耳其文
  • 1 篇 德文
  • 1 篇 西班牙文
  • 1 篇 葡萄牙文
检索条件"主题词=Constraint Programming"
1854 条 记 录,以下是1731-1740 订阅
排序:
constraint (Logic) programming:A survey on research and applications
收藏 引用
Joint ERCIM/Compulog-Net Workshop on New Trends in constraints, 1999
作者: Rossi, Francesca Università di Padova Dipartimento di Matematica Pura ed Applicata Via Belzoni 7 Padova35131 Italy
constraint logic programming (CLP) is a multidisciplinary research area which can be located between Artificial Intelligence, Operation Research, and programming Languages, and has to do with modeling, solving, and pr... 详细信息
来源: 评论
Combining constraint logic programming techniques for solving linear problems
收藏 引用
Joint ERCIM/Compulog-Net Workshop on New Trends in constraints, 1999
作者: Bahgat, Reem Abdel-Rahman, Samir E. Department of Computer Science Computers and Information Cairo University Cairo Egypt Department of Computer and Information Sciences Satistical Studies and Research CairoUniversity Cairo Egypt
This paper presents a system for solving mixed infinite and finite domains linear problem using a constraint Logic programming (CLP) Environment. The contributions of our system are introduced in two directions. First... 详细信息
来源: 评论
Optimal block design models for course timetabling
收藏 引用
OPERATIONS RESEARCH LETTERS 2002年 第1期30卷 1-8页
作者: Baker, KR Magazine, MJ Polak, GG Dartmouth Coll Amos Tuck Sch Business Adm Hanover NH 03755 USA Univ Cincinnati Dept QAOM Cincinnati OH 45221 USA Wright State Univ MSIS Dept Dayton OH 45435 USA
We seek a timetable for courses offered in S sections to maximize contact among K student cohorts over T terms. For this combinatorial optimization problem we propose both integer programming and constraint programmin... 详细信息
来源: 评论
All-different polytopes
收藏 引用
JOURNAL OF COMBINATORIAL OPTIMIZATION 2002年 第3期6卷 335-352页
作者: Lee, J IBM Corp Thomas J Watson Res Ctr Dept Math Sci Yorktown Hts NY 10598 USA
We develop a parsimonious integer-programming model for all-different constraints.
来源: 评论
An optimal data structure to handle dynamic environments in non-deterministic computations
收藏 引用
COMPUTER LANGUAGES SYSTEMS & STRUCTURES 2002年 第2期28卷 181-201页
作者: Pontelli, E Ranjan, D Dal Palú, A New Mexico State Univ Dept Comp Sci Las Cruces NM 88003 USA
The single most serious issue in the development of a parallel implementation of non-deterministic programming languages and systems (e.g., logic programming, constraint programming, search-based artificial intelligen... 详细信息
来源: 评论
Using constraint-based operators to solve the vehicle routing problem with time windows
收藏 引用
JOURNAL OF HEURISTICS 2002年 第1期8卷 43-58页
作者: Rousseau, LM Gendreau, M Pesant, G Univ Montreal Dept Informat & Rech Operat Montreal PQ H3C 3J7 Canada Univ Montreal Ctr Res Transportat Montreal PQ H3C 3J7 Canada Ecole Polytech Dept Genie Elect & Genie Informat Montreal PQ H3C 3A7 Canada
This paper presents operators searching large neighborhoods in order to solve the vehicle routing problem. They make use of the pruning and propagation techniques of constraint programming which allow an efficient sea... 详细信息
来源: 评论
An optimal strategy for the constrained cycle cover problem
收藏 引用
ANNALS OF MATHEMATICS AND ARTIFICIAL INTELLIGENCE 2002年 第4期34卷 313-325页
作者: Pesant, G Soriano, P Ecole Polytech Dept Genie Informat Montreal PQ H3C 3A7 Canada Ecole Hautes Etud Commerciales Serv Methodes Quantitat Gest Montreal PQ H3T 2A7 Canada Univ Montreal Ctr Res Transportat Montreal PQ H3C 3J7 Canada
A common telecommunications network design strategy, in order to protect it against failures, is to achieve a decomposition into a set of rings covering the network. We propose a hybrid algorithm for the corresponding... 详细信息
来源: 评论
Configuration of complex products with constraint-based modeling
收藏 引用
Informatik - Forschung und Entwicklung 2002年 第4期17卷 167-176页
作者: John, Ulrich Geske, Ulrich DaimlerChrysler AG Research and Technology 10559 Berlin Alt-Moabit 96A Germany Fraunhofer Institut FIRST 12489 Berlin Kekuléstr. 7 Germany
The configuration of complex industrial products is often costly and inaccurate because of the numerous variants of products and their components. Improving the configuration of technical products using computer-suppo... 详细信息
来源: 评论
Cost based filtering for the constrained knapsack problem
收藏 引用
ANNALS OF OPERATIONS RESEARCH 2002年 第1-4期115卷 73-93页
作者: Fahle, T Sellmann, M Univ Gesamthsch Paderborn Dept Math & Comp Sci D-33102 Paderborn Germany
We present cost based filtering methods for Knapsack Problems (KPs). Cost based filtering aims at fixing variables with respect to the objective function. It is an important technique when solving complex problems suc... 详细信息
来源: 评论
Improved interval constraint propagation for constraints on partial derivatives
收藏 引用
International Conference on Computational Science
作者: Petrov, E Benhamou, F Univ Nantes IRIN F-44322 Nantes 03 France
Automatic differentiation (AD) automatically transforms programs which calculate elementary functions into programs which calculate the gradients of these functions. Unlike other differentiation techniques, AD allows ... 详细信息
来源: 评论