咨询与建议

限定检索结果

文献类型

  • 86 篇 期刊文献
  • 14 篇 会议
  • 2 篇 学位论文

馆藏范围

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

日期分布

学科分类号

  • 70 篇 管理学
    • 69 篇 管理科学与工程(可...
    • 4 篇 工商管理
  • 58 篇 工学
    • 38 篇 计算机科学与技术...
    • 9 篇 软件工程
    • 6 篇 电气工程
    • 6 篇 交通运输工程
    • 4 篇 信息与通信工程
    • 3 篇 土木工程
    • 2 篇 机械工程
    • 1 篇 动力工程及工程热...
    • 1 篇 石油与天然气工程
    • 1 篇 航空宇航科学与技...
    • 1 篇 环境科学与工程(可...
  • 53 篇 理学
    • 49 篇 数学
    • 2 篇 物理学
    • 1 篇 统计学(可授理学、...
  • 8 篇 经济学
    • 4 篇 应用经济学
    • 3 篇 理论经济学
  • 1 篇 军事学

主题

  • 102 篇 branch-and-cut a...
  • 10 篇 integer programm...
  • 7 篇 valid inequaliti...
  • 5 篇 combinatorial op...
  • 4 篇 routing
  • 4 篇 mixed-integer li...
  • 4 篇 safe set problem
  • 4 篇 vehicle routing
  • 4 篇 benders decompos...
  • 3 篇 traveling salesm...
  • 3 篇 branch-and-bound...
  • 3 篇 facets
  • 3 篇 polytope
  • 3 篇 weighted safe se...
  • 3 篇 cdn design
  • 3 篇 polyhedral study
  • 3 篇 integer linear p...
  • 3 篇 network design
  • 3 篇 mixed integer li...
  • 3 篇 location

机构

  • 3 篇 univ paris 06 la...
  • 2 篇 univ libre bruxe...
  • 2 篇 univ estadual ca...
  • 2 篇 france telecom r...
  • 2 篇 univ brescia dep...
  • 2 篇 univ fed flumine...
  • 2 篇 hec montreal mon...
  • 2 篇 univ coll dublin...
  • 2 篇 kedge business s...
  • 2 篇 ras ivannikov in...
  • 1 篇 univ bonn inst c...
  • 1 篇 univ liverpool s...
  • 1 篇 univ santiago ch...
  • 1 篇 johannes gutenbe...
  • 1 篇 tsinghua univ de...
  • 1 篇 ecole polytech c...
  • 1 篇 univ fed rio de ...
  • 1 篇 essec business s...
  • 1 篇 univ tehran med ...
  • 1 篇 beijing univ tec...

作者

  • 5 篇 mahjoub a. ridha
  • 5 篇 fouilhoux pierre
  • 4 篇 gourdin eric
  • 4 篇 speranza m. graz...
  • 4 篇 gouveia luis
  • 3 篇 simonetti luidi
  • 3 篇 bianchessi nicol...
  • 3 篇 laporte gilbert
  • 3 篇 malaguti enrico
  • 3 篇 fortz bernard
  • 3 篇 segura jean-math...
  • 2 篇 labbe martine
  • 2 篇 salazar-gonzalez...
  • 2 篇 laporte g
  • 2 篇 karaoglan ismail
  • 2 篇 de souza c. c.
  • 2 篇 corberan angel
  • 2 篇 simonetti l.
  • 2 篇 archetti claudia
  • 2 篇 plana isaac

语言

  • 90 篇 英文
  • 11 篇 其他
检索条件"主题词=Branch-and-cut Algorithm"
102 条 记 录,以下是51-60 订阅
排序:
The Multiple Steiner TSP with order constraints: complexity and optimization algorithms
收藏 引用
SOFT COMPUTING 2020年 第23期24卷 17957-17968页
作者: Gabrel, Virginie Mahjoub, A. Ridha Taktak, Raouia Uchoa, Eduardo PSL Res Univ Univ Paris Dauphine CNRS LAMSADE F-75016 Paris France Univ Sfax CRNS ISIMS Sfax Tunisia Univ Sfax CRNS LT2S Sfax Tunisia Univ Fed Fluminense Dept Engn Prod Niteroi RJ Brazil
We consider a variant of the Travelling Salesman Problem (TSP), the Multiple Steiner TSP with Order constraints (MSTSPO). Consider a weighted undirected graph and a set of salesmen, and each salesman is associated wit... 详细信息
来源: 评论
On integer and bilevel formulations for the k-vertex cut problem
收藏 引用
MATHEMATICAL PROGRAMMING COMPUTATION 2020年 第2期12卷 133-164页
作者: Furini, Fabio Ljubic, Ivana Malaguti, Enrico Paronuzzi, Paolo Univ Paris 09 LAMSADE Paris France ESSEC Business Sch Paris Cergy France Univ Bologna DEI Bologna Italy
The family of critical node detection problems asks for finding a subset of vertices, deletion of which minimizes or maximizes a predefined connectivity measure on the remaining network. We study a problem of this fam... 详细信息
来源: 评论
A new formulation for the Weighted Safe Set Problem
收藏 引用
Procedia Computer Science 2021年 195卷 508-515页
作者: Enrico Malaguti Vagner Pedrotti Dipartimento di Ingegneria dell’Energia Elettrica e dell’Informazione “Guglielmo Marconi” Università di Bologna. Bologna Italy Faculty of Computing Federal University of Mato Grosso do Sul. Campo Grande Brazil
Given a connected graph G = ( V, E ), a Safe Set S is a subset of the vertex set V such that the cardinality of each connected component in the subgraph induced by V \ S does not exceed the cardinality of any connecte... 详细信息
来源: 评论
A new formulation for the Safe Set problem on graphs
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2019年 111卷 346-356页
作者: Uzeda Macambira, Ana Flavia Simonetti, Luidi Barbalho, Hugo Gonzalez, Pedro Henrique Maculan, Nelson Univ Fed Paraiba Dept Estatist Joao Pessoa Paraiba Brazil Univ Fed Rio de Janeiro Programa Engn Sistemas & Comp Rio De Janeiro Brazil Ctr Fed Educ Tecnol Celso Suckow da Fonseca Dept Informat Rio De Janeiro Brazil
Let G = (V, E) be a finite simple connected graph and S be a non-empty subset of V, the subgraph of G induced by the subset S is denoted by G[S]. Consider the function w, which assigns a positive real number as a weig... 详细信息
来源: 评论
An exact approach for the r-interdiction covering problem with fortification
收藏 引用
CENTRAL EUROPEAN JOURNAL OF OPERATIONS RESEARCH 2019年 第1期27卷 111-131页
作者: Roboredo, Marcos Costa Aizemberg, Luiz Pessoa, Artur Alves Univ Fed Fluminense Dept Engn Prod Rua Passo Patria 156 BR-24210240 Niteroi RJ Brazil Banco Nacl Desenvolvimento Ave Republ Chile 100 BR-20031917 Rio De Janeiro RJ Brazil
In this paper we treat the r-interdiction covering problem with fortification (RICF). The environment of this problem is composed of a set of customers J and a set of facilities I. For each customer j, there is set of... 详细信息
来源: 评论
Tugboat scheduling for container ports
收藏 引用
TRANSPORTATION RESEARCH PART E-LOGISTICS AND TRANSPORTATION REVIEW 2020年 142卷 102071-102071页
作者: Wei, Xiaoyang Jia, Shuai Meng, Qiang Tan, Kok Choon Natl Univ Singapore Dept Civil & Environm Engn Singapore 117576 Singapore Natl Univ Singapore Dept Ind Syst Engn & Management Singapore 117576 Singapore Shenzhen Univ Coll Management Inst Big Data Intelligent Management & Decis Shenzhen 518061 Peoples R China Natl Univ Singapore Inst Operat Res & Analyt Singapore 117602 Singapore Natl Univ Singapore Sch Business Dept Analyt & Operat Singapore 11924 Singapore
Container ports play an important role in global logistics and supply chains by providing container handling services for container ships. In a port, container ships usually need the assistance of tugboats in order to... 详细信息
来源: 评论
Vessel routing and optimization for marine debris collection with consideration of carbon cap
收藏 引用
JOURNAL OF CLEANER PRODUCTION 2020年 263卷 121399-121399页
作者: Duan, Gang Nur, Farjana Alizadeh, Morteza Chen, Li Marufuzzaman, Mohammad Ma, Junfeng Lanzhou Jiaotong Univ Sch Traff & Transportat Lanzhou 730070 Gansu Peoples R China Mississippi State Univ Dept Ind & Syst Engn Mississippi State MS 39762 USA Lanzhou City Univ Dept Math Lanzhou 730070 Gansu Peoples R China
Marine debris pollution is becoming an increasingly serious problem, affecting not only navigational safety but also the health of marine ecosystems. Carbon emission causes ocean acidification, which greatly harms mar... 详细信息
来源: 评论
Fast bounding technique for branch-and-cut algorithm based monthly SCUC
Fast bounding technique for branch-and-cut algorithm based m...
收藏 引用
General Meeting of the IEEE-Power-and-Energy-Society
作者: Wang, Peng Wang, Yang Xia, Qing Tsinghua Univ Dept Elect Engn State Key Lab Power Syst Beijing 100084 Peoples R China
Monthly unit commitment with energy constraints is crucial for reducing the energy consumption of generation scheduling. Restricted by the calculation complexity, most approaches for long-term SCUC have to sacrifice t... 详细信息
来源: 评论
The Shared Customer Collaboration Vehicle Routing Problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2018年 第3期265卷 1078-1093页
作者: Fernandez, Elena Roca-Riu, Mireia Speranza, M. Grazia Barcelona Tech UPC Dept Stat & Operat Res Carrer Jordi Girona1C5-208 Barcelona 08034 Spain Barcelona Grad Sch Math BGSMath Edifici C Bellaterra 08193 Spain Swiss Fed Inst Technol Zurich ETHZ Inst Transport Planning & Syst Stefano Franscini Pl 5HIL F 34-2 Zurich Switzerland Univ Brescia Dipartimento Metodi Quantitat Contrada Santa Chiara 50 I-25122 Brescia Italy
This paper introduces a new vehicle routing problem that arises in an urban area where several carriers operate and some of their customers have demand of service for more than one carrier. The problem, called Shared ... 详细信息
来源: 评论
A hybrid approach for biobjective optimization
收藏 引用
DISCRETE OPTIMIZATION 2018年 28卷 89-114页
作者: Stidsen, Thomas Andersen, Kim Allan Tech Univ Denmark DTU Management Lyngby Denmark Aarhus Univ Dept Econ & Business Econ Aarhus Denmark
A large number of the real world planning problems which are today solved using Operations Research methods are actually multiobjective planning problems, but most of them are solved using singleobjective methods. The... 详细信息
来源: 评论