咨询与建议

限定检索结果

文献类型

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

馆藏范围

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

日期分布

学科分类号

  • 62 篇 工学
    • 47 篇 计算机科学与技术...
    • 14 篇 电气工程
    • 11 篇 软件工程
    • 5 篇 控制科学与工程
    • 3 篇 机械工程
    • 2 篇 电子科学与技术(可...
    • 2 篇 信息与通信工程
    • 1 篇 动力工程及工程热...
    • 1 篇 建筑学
    • 1 篇 土木工程
    • 1 篇 石油与天然气工程
    • 1 篇 交通运输工程
    • 1 篇 环境科学与工程(可...
    • 1 篇 城乡规划学
  • 58 篇 理学
    • 55 篇 数学
    • 1 篇 物理学
    • 1 篇 地理学
    • 1 篇 大气科学
    • 1 篇 系统科学
  • 48 篇 管理学
    • 46 篇 管理科学与工程(可...
    • 9 篇 工商管理
    • 1 篇 公共管理
  • 8 篇 经济学
    • 8 篇 应用经济学
  • 1 篇 法学
    • 1 篇 社会学
  • 1 篇 医学
    • 1 篇 临床医学
  • 1 篇 军事学

主题

  • 100 篇 linear programmi...
  • 17 篇 approximation al...
  • 9 篇 integer programm...
  • 5 篇 markov random fi...
  • 5 篇 complexity
  • 4 篇 graphical model
  • 4 篇 heuristics
  • 4 篇 valued constrain...
  • 4 篇 network design
  • 4 篇 integrality gap
  • 4 篇 scheduling
  • 3 篇 lagrangean relax...
  • 3 篇 packing
  • 3 篇 discrete energy ...
  • 3 篇 multiplicative b...
  • 3 篇 approximation
  • 3 篇 combinatorial op...
  • 3 篇 steiner tree
  • 2 篇 uniform metric l...
  • 2 篇 project scheduli...

机构

  • 4 篇 mit alfred p slo...
  • 3 篇 univ bologna dei...
  • 3 篇 univ bologna dip...
  • 3 篇 aarhus univ dept...
  • 3 篇 czech tech univ ...
  • 2 篇 middle e tech un...
  • 2 篇 univ libre bruxe...
  • 2 篇 tech univ berlin...
  • 2 篇 univ padua dipar...
  • 2 篇 univ waterloo de...
  • 2 篇 tech univ berlin...
  • 2 篇 monash univ sch ...
  • 2 篇 nyu stern sch bu...
  • 2 篇 at&t labs res in...
  • 2 篇 middle e tech un...
  • 2 篇 izmir univ econ ...
  • 2 篇 univ fed rio de ...
  • 2 篇 hefei univ techn...
  • 2 篇 zhejiang univ st...
  • 2 篇 hec montreal dep...

作者

  • 7 篇 werner tomas
  • 4 篇 azizoglu meral
  • 4 篇 prusa daniel
  • 4 篇 schulz as
  • 3 篇 caprara a
  • 3 篇 kulkarni ankur a...
  • 3 篇 rizzi r
  • 3 篇 panconesi a
  • 2 篇 resende mgc
  • 2 篇 yang zaiyue
  • 2 篇 chai bo
  • 2 篇 aprile manuel
  • 2 篇 karsu ozlem
  • 2 篇 terno j
  • 2 篇 ardestani-jaafar...
  • 2 篇 jose sharu there...
  • 2 篇 sviridenko maxim
  • 2 篇 lucena a
  • 2 篇 zhang jiawei
  • 2 篇 fiorini samuel

语言

  • 93 篇 英文
  • 7 篇 其他
检索条件"主题词=Linear programming relaxation"
100 条 记 录,以下是1-10 订阅
排序:
Revisiting the linear programming relaxation Approach to Gibbs Energy Minimization and Weighted Constraint Satisfaction
收藏 引用
IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2010年 第8期32卷 1474-1488页
作者: Werner, Tomas Czech Tech Univ Dept Cybernet Prague 12135 Czech Republic
We present a number of contributions to the LP relaxation approach to weighted constraint satisfaction (= Gibbs energy minimization). We link this approach to many works from constraint programming, which relation has... 详细信息
来源: 评论
Piecewise linear Valued CSPs Solvable by linear programming relaxation
收藏 引用
ACM TRANSACTIONS ON COMPUTATIONAL LOGIC 2022年 第1期23卷 1-35页
作者: Bodirsky, Manuel Mamino, Marcello Viola, Caterina Tech Univ Dresden Inst Algebra D-01062 Dresden Germany Univ Pisa Dipartimento Matemat I-56127 Pisa Italy Univ Oxford Dept Comp Sci Oxford OX1 3QD England
Valued constraint satisfaction problems (VCSPs) are a large class of combinatorial optimisation problems. The computational complexity of VCSPs depends on the set of allowed cost functions in the input. Recently, the ... 详细信息
来源: 评论
A linear programming relaxation Based Approach for Generating Barrier Certificates of Hybrid Systems  21st
A Linear Programming Relaxation Based Approach for Generatin...
收藏 引用
21st International Symposium on Formal Methods (FM)
作者: Yang, Zhengfeng Huang, Chao Chen, Xin Lin, Wang Liu, Zhiming East China Normal Univ Shanghai Key Lab Trustworthy Comp Shanghai Peoples R China Nanjing Univ State Key Lab Novel Software Technol Nanjing Jiangsu Peoples R China Chinese Acad Sci AMSS Key Lab Math Mech Beijing Peoples R China Southwest Univ Ctr Res & Innovat Software Engn Chongqing Peoples R China
This paper presents a linear programming (LP) relaxation based approach for generating polynomial barrier certificates for safety verification of semi-algebraic hybrid systems. The key idea is to introduce an LP relax... 详细信息
来源: 评论
Fast Koopman Surrogate Falsification Using linear relaxations and Weights  22nd
Fast Koopman Surrogate Falsification Using Linear Relaxation...
收藏 引用
22nd International Symposium on Automated Technology for Verification and Analysis
作者: Bak, Stanley Hekal, Abdelrahman Kochdumper, Niklas Lew, Ethan Mata, Andrew Rahmati, Amir SUNY Stony Brook Dept Comp Sci Stony Brook NY USA Newcastle Univ Sch Comp Newcastle Upon Tyne Tyne & Wear England Newcastle Univ Sch Comp Newcastle Upon Tyne Tyne & Wear England Univ Paris Cite CNRS IRIF F-75013 Paris France Galois Inc Portland OR USA
Recent work demonstrated that using Koopman surrogate models to falsify black-box models against signal temporal logic specifications is highly effective. However, the bottleneck of this approach arises from the mixed... 详细信息
来源: 评论
linear programming relaxations and marginal productivity index policies for the buffer sharing problem
收藏 引用
QUEUEING SYSTEMS 2008年 第3-4期60卷 247-269页
作者: Cao, Jianhua Nyberg, Christian Lund Univ Elect & Informat Technol Dept S-22100 Lund Sweden
We study the dynamic admission control for a finite shared buffer with support of multiclass traffic under Markovian assumptions. The problem is often referred to as buffer sharing in the literature. From the linear p... 详细信息
来源: 评论
Approximation Algorithms and linear programming relaxations for Scheduling Problems Related to Min-Sum Set Cover
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2024年 第1期49卷 578-599页
作者: Happach, Felix Schulz, Andreas S. Tech Univ Munich Sch Computat Informat & Technol Operat Res Grp D-80333 Munich Germany Tech Univ Munich Sch Management Operat Res Grp D-80333 Munich Germany
We consider single-machine scheduling problems that are natural generalizations or variations of the min-sum set-cover problem. For these scheduling problems, we give new approximation algorithms. Some of these algori... 详细信息
来源: 评论
Iterative learning for optimal residential load scheduling in smart grid
收藏 引用
AD HOC NETWORKS 2016年 第May期41卷 99-111页
作者: Chai, Bo Yang, Zaiyue Gao, Kunlun Zhao, Ting State Grid Smart Grid Res Inst Beijing 102211 Peoples R China Zhejiang Univ State Key Lab Ind Control Technol Hangzhou 310027 Zhejiang Peoples R China
In this paper, as a fundamental problem in smart grid, the residential load scheduling is studied in a comprehensive way. The main contributions lie in threefold. First, three indices, i.e., the power consumption expe... 详细信息
来源: 评论
Solving project scheduling problems by minimum cut computations
收藏 引用
MANAGEMENT SCIENCE 2003年 第3期49卷 330-350页
作者: Möhring, RH Schulz, AS Stork, F Uetz, M Tech Univ Berlin Fak 2 Inst Math D-10623 Berlin Germany MIT Alfred P Sloan Sch Management Cambridge MA 02139 USA ILOG Deutschland GmbH D-61352 Bad Homburg Germany Univ Limburg Fac Econ & Business Adm NL-6200 MD Maastricht Netherlands
In project scheduling, a set of precedence-constrained jobs has to be scheduled so as to minimize a given objective. In resource-constrained project scheduling, the jobs additionally compete for scarce resources. Due ... 详细信息
来源: 评论
INTEGRALITY RATIO FOR GROUP STEINER TREES AND DIRECTED STEINER TREES
收藏 引用
SIAM JOURNAL ON COMPUTING 2007年 第5期36卷 1494-1511页
作者: Halperin, Eran Kortsarz, Guy Krauthgamer, Robert Srinivasan, Aravind Wang, Nan Int Comp Sci Inst Berkeley CA 94704 USA Univ Calif Berkeley Div Comp Sci Berkeley CA 94720 USA Rutgers State Univ Dept Comp Sci Camden NJ 08102 USA IBM Almaden Res Ctr San Jose CA 95120 USA Univ Maryland Dept Comp Sci College Pk MD 20742 USA Univ Maryland Inst Adv Comp Studies College Pk MD 20742 USA Morgan Stanley Inc New York NY 10020 USA
The natural relaxation for the group Steiner tree problem, as well as for its generalization, the directed Steiner tree problem, is a flow-based linear programming relaxation. We prove new lower bounds on the integral... 详细信息
来源: 评论
The multi-resource agent bottleneck generalised assignment problem
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH 2012年 第2期50卷 309-324页
作者: Karsu, Ozlem Azizoglu, Meral Middle E Tech Univ Dept Ind Engn TR-06531 Ankara Turkey
In this study, we consider the multi resource agent bottleneck generalised assignment problem. Our aim is to minimise the maximum load over all agents. We take our motivation from an assignment problem faced in heatin... 详细信息
来源: 评论