咨询与建议

限定检索结果

文献类型

  • 20 篇 期刊文献
  • 4 篇 会议

馆藏范围

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

日期分布

学科分类号

  • 16 篇 理学
    • 14 篇 数学
    • 2 篇 生物学
  • 15 篇 管理学
    • 15 篇 管理科学与工程(可...
    • 1 篇 工商管理
  • 14 篇 工学
    • 6 篇 计算机科学与技术...
    • 3 篇 生物工程
    • 2 篇 信息与通信工程
    • 2 篇 交通运输工程
    • 1 篇 机械工程
    • 1 篇 材料科学与工程(可...
    • 1 篇 电气工程
    • 1 篇 化学工程与技术
    • 1 篇 软件工程
  • 2 篇 医学
  • 1 篇 经济学
    • 1 篇 理论经济学
    • 1 篇 应用经济学

主题

  • 24 篇 integer programm...
  • 2 篇 location-routing...
  • 2 篇 multi products
  • 2 篇 integer programm...
  • 2 篇 supply chain man...
  • 2 篇 min-max objectiv...
  • 2 篇 heuristic
  • 2 篇 integer programm...
  • 2 篇 p-center problem
  • 2 篇 pickup and deliv...
  • 2 篇 survivable netwo...
  • 2 篇 location
  • 2 篇 edge-disjoint pa...
  • 2 篇 relaxation compl...
  • 1 篇 covid-19
  • 1 篇 university timet...
  • 1 篇 network flow for...
  • 1 篇 traveling salesm...
  • 1 篇 graphs
  • 1 篇 combinatorics

机构

  • 2 篇 btu cottbus senf...
  • 2 篇 eindhoven univ t...
  • 2 篇 johannes kepler ...
  • 2 篇 johannes kepler ...
  • 1 篇 university of lo...
  • 1 篇 mit alfred p slo...
  • 1 篇 seton hall unive...
  • 1 篇 tu eindhoven pob...
  • 1 篇 univ lisbon fac ...
  • 1 篇 kuwait univ safa...
  • 1 篇 univ paris 09 la...
  • 1 篇 univ clermont fe...
  • 1 篇 univ santiago ch...
  • 1 篇 univ adolfo iban...
  • 1 篇 kyoto univ bioin...
  • 1 篇 hofstra universi...
  • 1 篇 ball state unive...
  • 1 篇 univ pannonia de...
  • 1 篇 department of ma...
  • 1 篇 univ coll dublin...

作者

  • 3 篇 hojny christophe...
  • 2 篇 akutsu tatsuya
  • 2 篇 averkov gennadiy
  • 2 篇 gaar elisabeth
  • 2 篇 sinnl markus
  • 2 篇 schymura matthia...
  • 1 篇 rahmani younes
  • 1 篇 hurkens cor
  • 1 篇 ventura paolo
  • 1 篇 kasugai hiroshi
  • 1 篇 elloumi sourour
  • 1 篇 bacci tiziano
  • 1 篇 jelic slobodan
  • 1 篇 correa jr
  • 1 篇 mahjoub a. ridha
  • 1 篇 van den broek jo...
  • 1 篇 poolsap unyanee
  • 1 篇 davidovic tatjan...
  • 1 篇 ales zacharie
  • 1 篇 abdullah a

语言

  • 24 篇 英文
检索条件"主题词=Integer Programming formulation"
24 条 记 录,以下是11-20 订阅
A decomposition algorithm for the ring spur assignment problem
收藏 引用
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2013年 第1期20卷 119-139页
作者: Carroll, Paula McGarraghy, Sean Univ Coll Dublin Quinn Sch Business Ctr Business Analyt Dublin 4 Ireland
This paper describes the ring spur assignment problem (RSAP), a new problem arising in the design of next generation networks. The RSAP complements the sonet ring assignment problem (SRAP). We describe the RSAP, posit... 详细信息
来源: 评论
Lagrangian relaxation heuristics for the uncapacitated single-source multi-product facility location problem
收藏 引用
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS 2013年 第2期145卷 713-723页
作者: Nezhad, Ali Mohammad Manzour, Hasan Salhi, Said Sharif Univ Technol Dept Ind Engn Tehran Iran Univ Oklahoma Sch Ind & Syst Engn Norman OK 73019 USA Univ Kent Kent Business Sch Ctr Logist & Heurist Optimisat Canterbury Kent England
Facility location problem is one of the strategic logistical drivers within the supply chain which is a hard to solve optimization problem. In this study, we focus on the uncapacitated single-source multi-product prod... 详细信息
来源: 评论
Multi-products Location-Routing problem with Pickup and Delivery
Multi-products Location-Routing problem with Pickup and Deli...
收藏 引用
International Conference on Advanced Logistics and Transport (ICALT)
作者: Rahmani, Younes Oulamara, Ammar Cherif, Wahiba Ramdane Univ Lorraine LORIA UMR Lab 7503 Nancy France
An extended variant of Location-Routing Problem namely LRP with Multi-Product and Pickup and Delivery (LRP-MPPD) is considered in this study. The proposed model deals with simultaneously selecting (locating) one or mo... 详细信息
来源: 评论
Multi-products Location-Routing problem with Pickup and Delivery
Multi-products Location-Routing problem with Pickup and Deli...
收藏 引用
International Conference on Advanced Logistics and Transport
作者: Younes Rahmani Ammar Oulamara Wahiba Ramdane Cherif University of Lorraine LORIA UMR 7503 Laboratory
An extended variant of Location-Routing Problem namely LRP with Multi-Product and Pickup and Delivery (LRP-MPPD) is considered in this study. The proposed model deals with simultaneously selecting (locating) one or mo... 详细信息
来源: 评论
integer programming-based method for grammar-based tree compression and its application to pattern extraction of glycan tree structures
收藏 引用
BMC BIOINFORMATICS 2010年 第s11期11卷 1-11页
作者: Zhao, Yang Hayashida, Morihiro Akutsu, Tatsuya Kyoto Univ Bioinformat Ctr Inst Chem Res Kyoto 6110011 Japan
Background: A bisection-type algorithm for the grammar-based compression of tree-structured data has been proposed recently. In this framework, an elementary ordered-tree grammar (EOTG) and an elementary unordered-tre... 详细信息
来源: 评论
Prediction of RNA secondary structure with pseudoknots using integer programming
收藏 引用
BMC BIOINFORMATICS 2009年 第Sup1期10卷 1-11页
作者: Poolsap, Unyanee Kato, Yuki Akutsu, Tatsuya Kyoto Univ Inst Chem Res Bioinformat Ctr Kyoto 6110011 Japan
Background: RNA secondary structure prediction is one major task in bioinformatics, and various computational methods have been proposed so far. Pseudoknot is one of the typical substructures appearing in several RNAs... 详细信息
来源: 评论
Optimal Schedule of a Dairy Manufactory
收藏 引用
CHEMICAL AND BIOCHEMICAL ENGINEERING QUARTERLY 2009年 第2期23卷 231-237页
作者: Adonyi, R. Shopova, E. Vaklieva-Bancheva, N. Bulgarian Acad Sci Inst Chem Engn BU-1113 Sofia Bulgaria Univ Pannonia Dept Comp Sci H-8200 Veszprem Hungary
This paper deals with short-term scheduling of the dairy industry. Two different approaches are proposed for obtaining the minimal makespan schedules. According to the first, S-graph framework is proposed to find the ... 详细信息
来源: 评论
integer programming formulations for the two 4-hop-constrained paths problem
收藏 引用
NETWORKS 2007年 第2期49卷 135-144页
作者: Huygens, David Mahjoub, A. Ridha Univ Clermont Ferrand LIMOS CNRS UMR 6158 F-63177 Clermont Ferrand France Free Univ Brussels Dept Informat B-1050 Brussels Belgium
In this article, we consider the two 4-hop-constrained paths problem, which consists, given a graph G = (N, E) and two nodes s, t is an element of N, of finding a minimum cost sub-graph in G containing at least two no... 详细信息
来源: 评论
Timetabling problems at the TU Eindhoven
收藏 引用
Electronic Notes in Discrete Mathematics 2006年 第SPEC. ISS.期25卷 27-28页
作者: van den Broek, John Hurkens, Cor Woeginger, Gerhard Department of Mathematics and Computer Science TU Eindhoven 5600 MB Eindhoven P.O Box 513 Netherlands Department of Mathematics and Computer Science TU Eindhoven 5600 MB Eindhoven P.O Box 513 Netherlands Department of Mathematics and Computer Science TU Eindhoven 5600 MB Eindhoven P.O Box 513 Netherlands
来源: 评论
Single-machine scheduling with precedence constraints
收藏 引用
MATHEMATICS OF OPERATIONS RESEARCH 2005年 第4期30卷 1005-1021页
作者: Correa, JR Schulz, AS Univ Adolfo Ibanez Sch Business Santiago Chile MIT Alfred P Sloan Sch Management Cambridge MA 02139 USA
We discuss the problem of sequencing precedence-constrained jobs on a single machine to minimize the average weighted completion time. This problem has attracted much attention in the mathematical programming communit... 详细信息
来源: 评论