咨询与建议

限定检索结果

文献类型

  • 49 篇 期刊文献
  • 7 篇 会议

馆藏范围

  • 56 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 34 篇 工学
    • 28 篇 计算机科学与技术...
    • 7 篇 电气工程
    • 7 篇 软件工程
    • 3 篇 信息与通信工程
    • 3 篇 控制科学与工程
    • 2 篇 交通运输工程
    • 1 篇 土木工程
  • 33 篇 理学
    • 28 篇 数学
    • 3 篇 生物学
    • 3 篇 统计学(可授理学、...
    • 2 篇 系统科学
    • 1 篇 地理学
  • 29 篇 管理学
    • 29 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 5 篇 经济学
    • 2 篇 理论经济学
    • 2 篇 应用经济学
  • 1 篇 医学
    • 1 篇 临床医学

主题

  • 56 篇 branch-and-bound...
  • 11 篇 global optimizat...
  • 3 篇 concave minimiza...
  • 3 篇 computational bi...
  • 3 篇 gpu computing
  • 2 篇 approximation al...
  • 2 篇 hill-climbing
  • 2 篇 massively parall...
  • 2 篇 strong independe...
  • 2 篇 symmetry
  • 2 篇 flow-shop schedu...
  • 2 篇 spatial database...
  • 2 篇 r-tree
  • 2 篇 sum of ratios
  • 2 篇 optimization
  • 2 篇 fractional progr...
  • 2 篇 integer programm...
  • 2 篇 multiplicative p...
  • 2 篇 lipschitz optimi...
  • 2 篇 combinatorial op...

机构

  • 2 篇 hong kong univ s...
  • 2 篇 univ calabria de...
  • 2 篇 univ florida war...
  • 2 篇 alexandru ioan c...
  • 2 篇 univ wisconsin d...
  • 2 篇 univ cyprus dept...
  • 2 篇 city univ hong k...
  • 2 篇 univ lille 1 cnr...
  • 2 篇 inst math hanoi ...
  • 2 篇 univ nizhni novg...
  • 1 篇 york univ schuli...
  • 1 篇 univ london birk...
  • 1 篇 univ giessen fac...
  • 1 篇 natl taiwan univ...
  • 1 篇 ecole cent paris...
  • 1 篇 univ florida dep...
  • 1 篇 dfki gmbh german...
  • 1 篇 univ szeged inst...
  • 1 篇 natl chung hsing...
  • 1 篇 univ mons dept m...

作者

  • 4 篇 melab n.
  • 4 篇 chakroun i.
  • 3 篇 thoai nv
  • 2 篇 sergeyev yd
  • 2 篇 moral serafin
  • 2 篇 horst r
  • 2 篇 bendjoudi a.
  • 2 篇 cano andres
  • 2 篇 vassilakopoulos ...
  • 2 篇 pugliese p
  • 2 篇 famularo d
  • 2 篇 corral a
  • 2 篇 linderoth jeff
  • 2 篇 benson h. p.
  • 2 篇 gatu cristian
  • 2 篇 cheng tce
  • 2 篇 ostrowski james
  • 2 篇 mezmaz m.
  • 2 篇 benson hp
  • 2 篇 gomez manuel

语言

  • 53 篇 英文
  • 3 篇 其他
检索条件"主题词=branch-and-bound algorithms"
56 条 记 录,以下是31-40 订阅
排序:
Decomposition approach for the global minimization of biconcave functions over polytopes
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1996年 第3期88卷 561-583页
作者: Horst, R Thoai, NV INST MATH HANOI 10000VIETNAM
A decomposition approach is proposed for minimizing biconcave functions over polytopes. Important special cases include concave minimization, bilinear and indefinite quadratic programming for which new algorithms resu... 详细信息
来源: 评论
Utility function programs and optimization over the efficient set in multiple-objective decision making
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1997年 第3期92卷 605-631页
作者: Horst, R Thoai, NV INST MATH HANOI 10000VIETNAM
Natural basic concepts in multiple-objective optimization lead to difficult multiextremal global optimization problems. Examples include detection of efficient points when nonconvexities occur, and optimization of a l... 详细信息
来源: 评论
ADAPTIVE PARTITIONED RANDOM SEARCH TO GLOBAL OPTIMIZATION
收藏 引用
IEEE TRANSACTIONS ON AUTOMATIC CONTROL 1994年 第11期39卷 2235-2244页
作者: TANG, ZB HARVARD UNIV DIV APPL SCICAMBRIDGEMA
This paper considers global optimization (maximization) problems. It emphasizes that for a generic function, it is inherently difficult to find the global optimum within a finite number of function evaluations. Theref... 详细信息
来源: 评论
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2019年 第2期279卷 308-319页
作者: Chassein, Andre Goerigk, Marc Kurtz, Jannis Poss, Michael Deutsch Post DHL Grp Data Analyt Ctr Excellence Bonn Germany Univ Siegen Network & Data Sci Management Siegen Germany Rhein Westfal TH Aachen Dept Math Aachen Germany Univ Montpellier LIRMM CNRS Montpellier France
We consider robust combinatorial optimization problems where the decision maker can react to a scenario by choosing from a finite set of k solutions. This approach is appropriate for decision problems under uncertaint... 详细信息
来源: 评论
Solving a class of multiplicative programs with 0-1 knapsack constraints
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 1999年 第1期103卷 121-135页
作者: Kuno, T Univ Tsukuba Inst Informat Sci & Elect Ibaraki Osaka Japan
We develop a branch-and-bound algorithm to solve a nonlinear class of 0-1 knapsack problems. The objective function is a product of m greater than or equal to 2 affine functions, whose variables are mutually exclusive... 详细信息
来源: 评论
Duality bound method for the general quadratic programming problem with quadratic constraints
收藏 引用
JOURNAL OF OPTIMIZATION THEORY AND APPLICATIONS 2000年 第2期107卷 331-354页
作者: Thoai, NV Univ Trier Dept Math Trier Germany
The purpose of this article is to develop a branch-and-bound algorithm using duality bounds for the general quadratically-constrained quadratic programming problem and having the following properties: (i) duality boun... 详细信息
来源: 评论
Solving large Steiner Triple Covering Problems
收藏 引用
OPERATIONS RESEARCH LETTERS 2011年 第2期39卷 127-131页
作者: Ostrowski, James Linderoth, Jeff Rossi, Fabrizio Smriglio, Stefano Univ Aquila Dipartimento Informat I-67010 Coppito AQ Italy Univ Wisconsin Dept Ind & Syst Engn Madison WI 53706 USA Univ Waterloo Dept Management Sci Waterloo ON N2L 3G1 Canada
Computing the 1-width of the incidence matrix of a Steiner Triple System gives rise to highly symmetric and computationally challenging set covering problems. The largest instance solved so far corresponds to a Steine... 详细信息
来源: 评论
On linear programming relaxations for solving polynomial programming problems
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2018年 99卷 67-77页
作者: Dalkiran, Evrim Ghalami, Laleh Wayne State Univ Ind & Syst Engn 4815 Fourth St Detroit MI 48202 USA
This paper studies linear programming (LP) relaxations for solving polynomial programming problems. A polynomial programming problem can be equivalently formulated as a quadratically constrained quadratic program (QCQ... 详细信息
来源: 评论
Orbital branching
收藏 引用
MATHEMATICAL PROGRAMMING 2011年 第1期126卷 147-178页
作者: Ostrowski, James Linderoth, Jeff Rossi, Fabrizio Smriglio, Stefano Univ Wisconsin Dept Ind & Syst Engn Madison WI 53706 USA Lehigh Univ Dept Ind & Syst Engn Bethlehem PA 18015 USA Univ Aquila Dipartimento Informat I-67100 Laquila Italy
We introduce orbital branching, an effective branching method for integer programs containing a great deal of symmetry. The method is based on computing groups of variables that are equivalent with respect to the symm... 详细信息
来源: 评论
Multi-way distance join queries in spatial databases
收藏 引用
GEOINFORMATICA 2004年 第4期8卷 373-402页
作者: Corral, A Manolopoulos, Y Theodoridis, Y Vassilakopoulos, M Univ Almeria Dept Languages & Computat Almeria 04120 Spain Aristotle Univ Thessaloniki Dept Informat GR-54006 Thessaloniki Greece Univ Piraeus Dept Informat GR-18534 Piraeus Greece TEI Thessaloniki Dept Informat GR-54101 Thessaloniki Greece
Let a tuple of n objects obeying a query graph (QG) be called the n-tuple. The D-distance-value- of this n-tuple is the value of a linear function of distances of the n objects that make up this n-tuple, according to ... 详细信息
来源: 评论