咨询与建议

限定检索结果

文献类型

  • 6 篇 期刊文献
  • 4 篇 会议
  • 1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 6 篇 工学
    • 5 篇 计算机科学与技术...
    • 3 篇 电气工程
    • 2 篇 软件工程
    • 1 篇 信息与通信工程
    • 1 篇 土木工程
    • 1 篇 交通运输工程
  • 5 篇 理学
    • 4 篇 数学
    • 1 篇 生物学
  • 4 篇 管理学
    • 4 篇 管理科学与工程(可...

主题

  • 11 篇 bi-objective com...
  • 1 篇 multiobjective o...
  • 1 篇 ε-constraint met...
  • 1 篇 load balancing
  • 1 篇 proportional fai...
  • 1 篇 millimeter wave
  • 1 篇 pareto front
  • 1 篇 link blockage
  • 1 篇 intracellular fl...
  • 1 篇 endosymbiotic ev...
  • 1 篇 branch and cut
  • 1 篇 graphical model
  • 1 篇 constraint optim...
  • 1 篇 thesis
  • 1 篇 transponson agen...
  • 1 篇 computational tr...
  • 1 篇 delta-dominating...
  • 1 篇 uflp
  • 1 篇 travel distance ...
  • 1 篇 tsp with profits

机构

  • 1 篇 univ hassan ii c...
  • 1 篇 univ estadual ce...
  • 1 篇 russian acad sci...
  • 1 篇 cairo univ fac e...
  • 1 篇 univ montreal de...
  • 1 篇 univ fed parana ...
  • 1 篇 department of st...
  • 1 篇 natl def acad de...
  • 1 篇 univ seville ins...
  • 1 篇 michigan state u...
  • 1 篇 institute of com...
  • 1 篇 univ fed toulous...
  • 1 篇 univ clermont au...
  • 1 篇 univ fed rio gra...
  • 1 篇 virginia tech | ...

作者

  • 1 篇 goncalves richar...
  • 1 篇 thi quynh trang ...
  • 1 篇 aghezzaf brahim
  • 1 篇 yamada takeo
  • 1 篇 bouziaren soumay...
  • 1 篇 xiao li
  • 1 篇 taniguchi fumiak...
  • 1 篇 abdelmaguid tame...
  • 1 篇 goldbarg elizabe...
  • 1 篇 viet hung nguyen
  • 1 篇 berube jean-fran...
  • 1 篇 buchet samuel
  • 1 篇 delgado myriam r...
  • 1 篇 carrizosa emilio
  • 1 篇 potvin jean-yves
  • 1 篇 minh hieu nguyen
  • 1 篇 de givry simon
  • 1 篇 gendreau michel
  • 1 篇 ushakov anton
  • 1 篇 ljubić ivana

语言

  • 10 篇 英文
  • 1 篇 其他
检索条件"主题词=Bi-objective combinatorial optimization"
11 条 记 录,以下是1-10 订阅
An exact ε-constraint method for bi-objective combinatorial optimization problems: Application to the Traveling Salesman Problem with Profits
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2009年 第1期194卷 39-50页
作者: Berube, Jean-Francois Gendreau, Michel Potvin, Jean-Yves Univ Montreal Dept Informat & Rech Operat Montreal PQ H3C 3J7 Canada
This paper describes an exact c-constraint method for bi-objective combinatorial optimization problems with integer objective values. This method tackles multi-objective optimization problems by solving it series of s... 详细信息
来源: 评论
An Improved Augmented ε-Constraint and Branch-and-Cut Method to Solve the TSP With Profits
收藏 引用
IEEE TRANSACTIONS ON INTELLIGENT TRANSPORTATION SYSTEMS 2019年 第1期20卷 195-204页
作者: Bouziaren, Soumaya Ait Aghezzaf, Brahim Univ Hassan II Casablanca Lab Informat & Aide Decis Dept Mathemat & Informat Fac Sci Casablanca 20000 Morocco
In this paper, a novel approach is presented to solve the traveling salesman problem with profits (TSPP). This problem is an extension of the famous traveling salesman problem (TSP) in which a prize is associated with... 详细信息
来源: 评论
Threshold robustness in discrete facility location problems: a bi-objective approach
收藏 引用
optimization LETTERS 2015年 第7期9卷 1297-1314页
作者: Carrizosa, Emilio Ushakov, Anton Vasilyev, Igor Univ Seville Inst Matemat E-41012 Seville Spain Russian Acad Sci Siberian Branch Matrosov Inst Syst Dynam & Control Theory Irkutsk 664033 Russia
The two best studied facility location problems are the -median problem and the uncapacitated facility location problem (Daskin, Network and discrete location: models, algorithms, and applications. Wiley, New York, 19... 详细信息
来源: 评论
A Transgenetic Algorithm for the bi-objective Traveling Purchaser Problem
A Transgenetic Algorithm for the Bi-objective Traveling Purc...
收藏 引用
2010 IEEE World Congress on Computational Intelligence
作者: Almeida, Carolina P. Goncalves, Richard A. Delgado, Myriam R. Goldbarg, Elizabeth F. Goldbarg, Marco C. Univ Fed Parana Grad Program Elect Engn & Comp Sci BR-80230901 Curitiba Parana Brazil Univ Estadual Centro Oeste Dept Comp Sci Guarapuava Brazil Univ Fed Rio Grande do Norte Natal RN Brazil
This work proposes an algorithm based on Computational Transgenetic (CT) metaphor to deal with the bi-objective traveling purchaser problem (2TPP). The 2TPP consists in determining a route through a subset of markets ... 详细信息
来源: 评论
Proportional Fairness for combinatorial optimization  16th
Proportional Fairness for Combinatorial Optimization
收藏 引用
16th Latin American Symposium on Theoretical Informatics (LATIN)
作者: Minh Hieu Nguyen Baiou, Mourad Viet Hung Nguyen Thi Quynh Trang Vo Univ Clermont Auvergne CNRS INP Clermont Auvergne Mines St EtienneUMR 6158 LIMOS 1 Rue Chebarde Aubiere France
Proportional fairness (PF) is a widely studied concept in the literature, particularly in telecommunications, network design, resource allocation, and social choice. It aims to distribute utilities to ensure fairness ... 详细信息
来源: 评论
Multi-objective Approach to Improve Load Balance and Blockage in Millimeter Wave Cellular Networks
Multi-Objective Approach to Improve Load Balance and Blockag...
收藏 引用
IEEE International Symposium on Dynamic Spectrum Access Networks (DySPAN)
作者: Zarifneshat, Masoud Roy, Proteek Xiao, Li Michigan State Univ Dept Comp Sci & Engn E Lansing MI 48824 USA
One of the main enabling technologies of SG wireless networks is to use mm-Wave spectrum band. Despite its large and wide frequency bandwidth, the obtained data rate can be diminished due to link blockage in this freq... 详细信息
来源: 评论
Solving the bi-objective prize-collecting Steiner tree problem with the ε-constraint method
收藏 引用
Electronic Notes in Discrete Mathematics 2013年 41卷 181-188页
作者: Leitner, Markus Ljubić, Ivana Sinnl, Markus Institute of Computer Graphics and Algorithms Vienna University of Technology Vienna Austria Department of Statistics and Operations Research University of Vienna Vienna Austria
In this paper, we study the bi-objective prize-collecting Steiner tree problem, whose goal is to find a subtree that minimizes the edge costs for building that tree, and, at the same time, to maximize the collected no... 详细信息
来源: 评论
bi-objective Discrete Graphical Model optimization  1
收藏 引用
21st International Conference on the Integration of Constraint Programming, Artificial Intelligence, and Operations Research (CPAIOR)
作者: Buchet, Samuel Allouche, David de Givry, Simon Schiex, Thomas Univ Fed Toulouse ANITI INRAE UR 875 F-31326 Toulouse France
Discrete Graphical Models (GMs) are widely used in Artificial Intelligence to describe complex systems through a joint function of interest. Probabilistic GMs such as Markov Random Fields (MRFs) define a joint non-nor... 详细信息
来源: 评论
bi-objective multi-assignment capacitated location-allocation problem
Bi-objective multi-assignment capacitated location-allocatio...
收藏 引用
作者: Maach, Fouad Virginia Tech | University
optimization problems of location-assignment correspond to a wide range of real situations, such as factory network design. However most of the previous works seek in most cases at minimizing a cost function. Traffic ... 详细信息
来源: 评论
bi-objective dynamic multiprocessor open shop scheduling for maintenance and healthcare diagnostics
收藏 引用
EXPERT SYSTEMS WITH APPLICATIONS 2021年 186卷
作者: Abdelmaguid, Tamer F. Cairo Univ Fac Engn Dept Mech Design & Prod Giza 12613 Egypt
This paper addresses a bi-objective dynamic multiprocessor open shop scheduling problem in which the simultaneous objectives of minimizing both the mean weighted flow time and the makespan are considered. This problem... 详细信息
来源: 评论