咨询与建议

限定检索结果

文献类型

  • 8 篇 期刊文献
  • 6 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 11 篇 工学
    • 9 篇 计算机科学与技术...
    • 2 篇 控制科学与工程
    • 1 篇 电气工程
    • 1 篇 软件工程
  • 6 篇 管理学
    • 6 篇 管理科学与工程(可...
  • 4 篇 理学
    • 4 篇 数学

主题

  • 14 篇 unconstrained bi...
  • 3 篇 local search
  • 2 篇 multi-objective ...
  • 2 篇 multiobjective c...
  • 2 篇 harmony search
  • 2 篇 teaching-learnin...
  • 2 篇 tabu search
  • 2 篇 hypervolume cont...
  • 2 篇 deep reinforceme...
  • 1 篇 zero-one optimiz...
  • 1 篇 traveling salesm...
  • 1 篇 max-cut
  • 1 篇 computational ef...
  • 1 篇 parallel metaheu...
  • 1 篇 combinatorial op...
  • 1 篇 maximum diversit...
  • 1 篇 diversification ...
  • 1 篇 heuristic
  • 1 篇 fast flip moves
  • 1 篇 heuristics

机构

  • 2 篇 southwest jiaoto...
  • 1 篇 univ angers leri...
  • 1 篇 minjiang univ de...
  • 1 篇 st cloud state u...
  • 1 篇 chinese acad sci...
  • 1 篇 okayama univ sci...
  • 1 篇 shenzhen inst in...
  • 1 篇 guangdong polyte...
  • 1 篇 shaanxi key labo...
  • 1 篇 univ elect sci &...
  • 1 篇 school of mathem...
  • 1 篇 natl univ def te...
  • 1 篇 huaqiao univ peo...
  • 1 篇 northwestern pol...
  • 1 篇 chinese acad sci...
  • 1 篇 univ roma la sap...
  • 1 篇 xi an jiao tong ...
  • 1 篇 chinese acad sci...
  • 1 篇 univ mississippi...
  • 1 篇 shaanxi univ tec...

作者

  • 2 篇 shang ming-sheng
  • 2 篇 xue li-yuan
  • 2 篇 zeng rong-qiang
  • 1 篇 piccialli veroni...
  • 1 篇 meneses claudio ...
  • 1 篇 longquan yong
  • 1 篇 sun jianyong
  • 1 篇 chen ming
  • 1 篇 wang haibo
  • 1 篇 wang yang
  • 1 篇 verel sebastien
  • 1 篇 palagi laura
  • 1 篇 lin geng
  • 1 篇 shi jialong
  • 1 篇 chen yuning
  • 1 篇 cai yiqiao
  • 1 篇 katayama k
  • 1 篇 narihisa h
  • 1 篇 wang qing-xian
  • 1 篇 hao jin-kao

语言

  • 14 篇 英文
检索条件"主题词=Unconstrained binary quadratic programming"
14 条 记 录,以下是11-20 订阅
排序:
PPLS/D: Parallel Pareto Local Search Based on Decomposition
收藏 引用
IEEE TRANSACTIONS ON CYBERNETICS 2020年 第3期50卷 1060-1071页
作者: Shi, Jialong Zhang, Qingfu Sun, Jianyong Xi An Jiao Tong Univ Sch Math & Stat Xian 710049 Peoples R China City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China
Pareto local search (PLS) is a basic building block in many metaheuristics for a multiobjective combinatorial optimization problem. In this paper, an enhanced PLS variant called parallel PLS based on decomposition (PP... 详细信息
来源: 评论
SpeeDP: an algorithm to compute SDP bounds for very large Max-Cut instances
收藏 引用
MATHEMATICAL programming 2012年 第2期136卷 353-373页
作者: Grippo, Luigi Palagi, Laura Piacentini, Mauro Piccialli, Veronica Rinaldi, Giovanni Univ Roma Tor Vergata Dipartimento Ingn Civile & Ingn Informat I-00133 Rome Italy Univ Roma La Sapienza Dipartimento Ingn Informat Automat & Gestionale A I-00185 Rome Italy CNR Ist Anal Sistemi & Informat A Ruberti I-00185 Rome Italy
We consider low-rank semidefinite programming (LRSDP) relaxations of unconstrained quadratic problems (or, equivalently, of Max-Cut problems) that can be formulated as the non-convex nonlinear programming problem of m... 详细信息
来源: 评论
A note on heuristic approach based on UBQP formulation of the maximum diversity problem
收藏 引用
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2017年 第1期68卷 102-110页
作者: Alidaee, Bahram Wang, Haibo Univ Mississippi Dept Mkt Sch Business Adm POB 1848 University MS 38677 USA Texas A&M Univ Coll Business Adm Laredo TX 78041 USA
The maximum diversity problem (MDP) is a challenging NP-hard problem with a wide range of real applications. Several researchers have pointed out close relationship between the MDP and unconstrained binary quadratic p... 详细信息
来源: 评论
Heuristic algorithms based on deep reinforcement learning for quadratic unconstrained binary optimization
收藏 引用
KNOWLEDGE-BASED SYSTEMS 2020年 207卷 106366-106366页
作者: Chen, Ming Chen, Yuning Du, Yonghao Wei, Luona Chen, Yingwu Natl Univ Def Technol Coll Syst Engn Changsha 410073 Peoples R China
The unconstrained binary quadratic programming (UBQP) problem is a difficult combinatorial optimization problem that has been intensively studied in the past decades. Due to its NP-hardness, many heuristic algorithms ... 详细信息
来源: 评论