咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是11-20 订阅
排序:
Detection of Code Spread OFDM based on 0–1 integer quadratic programming
Detection of Code Spread OFDM based on 0–1 Integer Quadrati...
收藏 引用
Asilomar Conference on Signals, Systems & Computers
作者: Ali Elghariani Michael D. Zoltowski School of Electrical and Computer Engineering Purdue University West Lafayette IN USA
In this paper we introduce integer quadratic programming (IQP) approach to detect QPSK Code Spread OFDM (CSOFDM) signal by formulating the problem as a combinatorial optimization problem. The Branch and Bound (BB) alg... 详细信息
来源: 评论
A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
收藏 引用
Electronic Notes in Discrete Mathematics 2010年 第C期36卷 271-278页
作者: Quadri, Dominique Soutif, Éric Université d'Avignon et des Pays du Vaucluse LIA F-84911 Avignon Cedex 9 France CEDRIC-CNAM 292 rue Saint Martin 75141 Paris Cedex 03 France
We study in this paper a general case of integer quadratic multi-knapsack problem (QMKP) where the objective function is non separable. An upper bound is proposed for (QMKP) which is computed via two steps. We first r... 详细信息
来源: 评论
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... 详细信息
来源: 评论
AN EFFICIENT BRANCH AND BOUND ALGORITHM TO SOLVE THE quadratic integer programming PROBLEM
收藏 引用
COMPUTING 1983年 第3期30卷 253-260页
作者: KORNER, F Sektion Mathematik Technische Universität Dresden Mommsenstrasse 13 DDR-8027 Dresden German Democratic Republic
The quadratic integer programming problem is considered. It will be shown in which order the variablesx1, ...,x n should be ramified in order to reduce the number of knots being studied to a minimum. There areO(n3) op... 详细信息
来源: 评论
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 ... 详细信息
来源: 评论
From Angular Manifolds to the integer Lattice: Guaranteed Orientation Estimation With Application to Pose Graph Optimization
收藏 引用
IEEE TRANSACTIONS ON ROBOTICS 2014年 第2期30卷 475-492页
作者: Carlone, Luca Censi, Andrea Georgia Inst Technol Coll Comp Atlanta GA 30332 USA MIT Informat & Decis Syst Lab Cambridge MA 02139 USA
Pose graph optimization from relative measurements is challenging because of the angular component of the poses: the variables live on a manifold product with nontrivial topology and the likelihood function is nonconv... 详细信息
来源: 评论
Efficient Feature Matching via Nonnegative Orthogonal Relaxation
收藏 引用
INTERNATIONAL JOURNAL OF COMPUTER VISION 2019年 第9期127卷 1345-1360页
作者: Jiang, Bo Tang, Jin Luo, Bin Anhui Univ Sch Comp Sci & Technol 111 Jiulong Rd Hefei Anhui Peoples R China
Feature matching problem that incorporates pair-wise constraints can be formulated as an integer quadratic programming (IQP) problem with one-to-one matching constraint. Since it is NP-hard, relaxation models are requ... 详细信息
来源: 评论
ON LOWER BOUNDS FOR A CLASS OF quadratic-0, 1 PROGRAMS
收藏 引用
OPERATIONS RESEARCH LETTERS 1985年 第4期4卷 175-180页
作者: ASSAD, AA XU, WX CHINESE ACAD SCI INST APPL MATHBEIJINGPEOPLES R CHINA
We present a new method of obtaining lower bounds for a class of quadratic 0, 1 programs that includes the quadratic assignment problem. The method generates a monotonic sequence of lower bounds and may be interpreted... 详细信息
来源: 评论
GENERALIZATION OF BARAHONAS ALGORITHM FOR CASES OF integer NONLINEAR-programming WITH BOX CONSTRAINTS
收藏 引用
OPERATIONS RESEARCH LETTERS 1993年 第2期13卷 99-105页
作者: BALDICK, R LAWRENCE BERKELEY LAB DEPT ELECT & COMP ENGNBERKELEYCA 94720
Barahona described a linear time algorithm for a class of 0-1 quadratic programming problems. The algorithm was based on a transformation to a max-cut problem. We describe a linear algorithm that treats a slightly mor... 详细信息
来源: 评论
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... 详细信息
来源: 评论