咨询与建议

限定检索结果

文献类型

  • 37 篇 期刊文献
  • 15 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 42 篇 工学
    • 25 篇 计算机科学与技术...
    • 11 篇 电气工程
    • 7 篇 信息与通信工程
    • 6 篇 软件工程
    • 2 篇 力学(可授工学、理...
    • 2 篇 控制科学与工程
    • 2 篇 化学工程与技术
    • 1 篇 仪器科学与技术
    • 1 篇 材料科学与工程(可...
    • 1 篇 测绘科学与技术
    • 1 篇 交通运输工程
  • 27 篇 理学
    • 22 篇 数学
    • 3 篇 物理学
    • 2 篇 生物学
    • 2 篇 系统科学
    • 2 篇 统计学(可授理学、...
    • 1 篇 化学
  • 15 篇 管理学
    • 15 篇 管理科学与工程(可...
  • 1 篇 医学
    • 1 篇 基础医学(可授医学...

主题

  • 52 篇 integer quadrati...
  • 6 篇 branch and bound
  • 4 篇 integer linear p...
  • 3 篇 mmse
  • 3 篇 computational co...
  • 3 篇 vertex cover
  • 3 篇 csofdm
  • 3 篇 quadratic progra...
  • 2 篇 branch-and-bound...
  • 2 篇 approximation al...
  • 2 篇 multiplicative u...
  • 2 篇 fpt
  • 2 篇 variable reducti...
  • 2 篇 subdeterminants
  • 2 篇 hot spot
  • 2 篇 feature matching
  • 2 篇 llr
  • 2 篇 protein
  • 2 篇 interface alignm...
  • 1 篇 fobos algorithm

机构

  • 2 篇 computer science...
  • 2 篇 purdue univ sch ...
  • 2 篇 indian inst tech...
  • 1 篇 anhui univ inst ...
  • 1 篇 univ wisconsin d...
  • 1 篇 chinese acad sci...
  • 1 篇 school of electr...
  • 1 篇 univ autonoma nu...
  • 1 篇 academy of mathe...
  • 1 篇 lawrence berkele...
  • 1 篇 univ caen norman...
  • 1 篇 friedrich alexan...
  • 1 篇 tokyo univ sci t...
  • 1 篇 cedric ensiie 1 ...
  • 1 篇 department of el...
  • 1 篇 department of pr...
  • 1 篇 anhui univ sch c...
  • 1 篇 comenius univ fa...
  • 1 篇 department of ba...
  • 1 篇 toyama prefectur...

作者

  • 4 篇 jiang bo
  • 4 篇 tang jin
  • 4 篇 luo bin
  • 2 篇 aute shubhada
  • 2 篇 elghariani ali
  • 2 篇 panolan fahad
  • 2 篇 zoltowski michae...
  • 2 篇 filova lenka
  • 2 篇 gautama sidharta
  • 2 篇 harman radoslav
  • 2 篇 korner f
  • 2 篇 del pia alberto
  • 2 篇 lin wang
  • 2 篇 raa birger
  • 2 篇 limere veronique
  • 2 篇 uzunosmanoglu me...
  • 1 篇 liu xinglong
  • 1 篇 gu xiaoyi
  • 1 篇 li yuanju
  • 1 篇 quadri dominique

语言

  • 52 篇 英文
检索条件"主题词=Integer Quadratic Programming"
52 条 记 录,以下是1-10 订阅
排序:
Proximity in concave integer quadratic programming
收藏 引用
MATHEMATICAL programming 2022年 第1-2期194卷 871-900页
作者: Del Pia, Alberto Ma, Mingchen Univ Wisconsin Dept Ind & Syst Engn Madison WI USA Univ Wisconsin Wisconsin Inst Discovery Madison WI USA Univ Wisconsin Dept Comp Sci Madison WI 53706 USA
A classic result by Cook, Gerards, Schrijver, and Tardos provides an upper bound of n Delta on the proximity of optimal solutions of an integer Linear programming problem and its standard linear relaxation. In this bo... 详细信息
来源: 评论
EXACT AUGMENTED LAGRANGIAN DUALITY FOR MIXED integer quadratic programming
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2020年 第1期30卷 781-797页
作者: Gu, Xiaoyi Ahmed, Shabbir Dey, Santanu S. Georgia Inst Technol H Milton Stewart Sch Ind & Syst Engn Atlanta GA 30332 USA
Mixed integer quadratic programming (MIQP) is the problem of minimizing a quadratic function over mixed integer points in a rational polyhedron. This paper focuses on the augmented Lagrangian dual (ALD) for MIQP. ALD ... 详细信息
来源: 评论
SUBDETERMINANTS AND CONCAVE integer quadratic programming
收藏 引用
SIAM JOURNAL ON OPTIMIZATION 2019年 第4期29卷 3154-3173页
作者: Del Pia, Alberto Univ Wisconsin Dept Ind & Syst Engn Madison WI 53706 USA Univ Wisconsin Wisconsin Inst Discovery Madison WI 53706 USA
We consider the NP-hard problem of minimizing a separable concave quadratic function over the integral points in a polyhedron, and we denote by Delta the largest absolute value of the subdeterminants of the constraint... 详细信息
来源: 评论
Computing efficient exact designs of experiments using integer quadratic programming
收藏 引用
COMPUTATIONAL STATISTICS & DATA ANALYSIS 2014年 71卷 1159-1167页
作者: Harman, Radoslav Filova, Lenka Comenius Univ Fac Math Phys & Informat Dept Appl Math & Stat Bratislava 84248 Slovakia
A new method for computing exact experimental designs for linear regression models by integer quadratic programming is proposed. The key idea is to use the criterion of DQ-optimality, which is a quadratic approximatio... 详细信息
来源: 评论
Alignment of Protein-Protein Interfaces by integer quadratic programming
Alignment of Protein-Protein Interfaces by Integer Quadratic...
收藏 引用
2012 International Conference on Convergence Computer Technology(IC3T 2012)
作者: Wen-Juan Zhang Lin Wang Department of Basic Courses Tianjin Foreign Studies University Tianjin China Computer Science and Information Engineering College Tianjin University of Science and Technology
Alignment of protein-protein interfaces plays a key role in the studies of protein function,signal transduction network and drug *** give a protein-protein interface alignment method which is based on an integer quadr... 详细信息
来源: 评论
Parameterized algorithms for minimum sum vertex cover
收藏 引用
THEORETICAL COMPUTER SCIENCE 2025年 1029卷
作者: Aute, Shubhada Panolan, Fahad Indian Inst Technol Hyderabad Sangareddy India Univ Leeds Sch Comp Sci Leeds England
A minimum sum vertex cover of an n-vertex graph G is a bijection : V(G)->[] that minimizes the cost ex) min ($(u). $()). Finding a minimum sum vertex cover of a graph (the MSVC problem) is NP-hard. MSVC is studied ... 详细信息
来源: 评论
The edge-preservation similarity for comparing rooted, unordered, node-labeled trees*
收藏 引用
PATTERN RECOGNITION LETTERS 2023年 第1期167卷 189-195页
作者: Boria, Nicolas Kiederle, Jana Yger, Florian Blumenthal, David B. PSL Univ Univ Paris Dauphine LAMSADE CNRSUMR7243 Paris France Friedrich Alexander Univ Erlangen Nurnberg Dept Artificial Intelligence Biomed Engn Biomed Network Sci Lab Erlangen Germany Normandie Univ GREYC CNRS ENSICAENUMR 6072 Caen France
Rooted trees are ubiquitous data structures which are used to model hierarchical objects from a plethora of different application domains. For various downstream analysis tasks, measures are needed that quan-tify (dis... 详细信息
来源: 评论
Norm-optimal iterative learning control in an integer-valued control domain
收藏 引用
INTERNATIONAL JOURNAL OF CONTROL 2023年 第1期96卷 170-181页
作者: Arnold, Florian King, Rudibert Tech Univ Berlin Chair Measurement & Control Dept Proc Engn Str 17 Juni 135 D-10623 Berlin Germany
Formulating a control design for integer-valued inputs might be advantageous over, for example, rounding strategies based on a real-valued solution. However, the speed of convergence, computational cost, and stability... 详细信息
来源: 评论
Parameterized Algorithms for Minimum Sum Vertex Cover  16th
Parameterized Algorithms for Minimum Sum Vertex Cover
收藏 引用
16th Latin American Symposium on Theoretical Informatics (LATIN)
作者: Aute, Shubhada Panolan, Fahad Indian Inst Technol Hyderabad Sangareddy India Univ Leeds Sch Comp Leeds W Yorkshire England
Minimum sum vertex cover of an n-vertex graph G is a bijection phi : V (G) -> [n] that minimizes the cost Sigma({u,v}is an element of E(G)) min{phi(u), phi(v)}. Finding a minimum sum vertex cover of a graph (the MS... 详细信息
来源: 评论
A semidefinite programming method for integer convex quadratic minimization
收藏 引用
OPTIMIZATION LETTERS 2018年 第3期12卷 499-518页
作者: Park, Jaehyun Boyd, Stephen Stanford Univ Packard BldgRoom 243350 Serra Mall Stanford CA 94305 USA Stanford Univ Packard BldgRoom 254350 Serra Mall Stanford CA 94305 USA
We consider the NP-hard problem of minimizing a convex quadratic function over the integer lattice Zn. We present a simple semidefinite programming (SDP) relaxation for obtaining a nontrivial lower bound on the optima... 详细信息
来源: 评论