咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是41-50 订阅
排序:
A branch-and-cut algorithm for the Multiple Steiner TSP with order constraints
收藏 引用
Electronic Notes in Discrete Mathematics 2013年 41卷 487-494页
作者: Borne, S. Mahjoub, A.R. Taktak, R. LIPN Paris 13 University France LAMSADE Paris Dauphine University France
The paper deals with a problem motivated by survivability issues in multilayer IP-over-WDM telecommunication networks. Given a set of traffic demands for which we know a survivable routing in the IP layer, our purpose... 详细信息
来源: 评论
Robust MILP formulations for the two-stage weighted vertex p-center problem
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2023年 第1期159卷
作者: Duran-Mateluna, Cristian Ales, Zacharie Elloumi, Sourour Jorquera-Bravo, Natalia Inst Polytech Paris UMA ENSTA Paris F-91120 Palaiseau France CEDRIC Conservatoire Natl Arts & Metiers F-75003 Paris France Univ Santiago Chile USACH Fac Engn Program Dev Sustainable Prod Syst PDSPS Santiago Chile Univ Santiago Chile USACH Fac Engn Ind Engn Dept Santiago Chile
The weighted vertex p-center problem (PCP ) consists of locating p facilities among a set of available sites such that the maximum weighted distance (or travel time) from any demand node to its closest located facilit... 详细信息
来源: 评论
A computational study on the Maximum-Weight Bounded-Degree Rooted Tree Problem
收藏 引用
APPLIED MATHEMATICS AND COMPUTATION 2022年 413卷 126623-126623页
作者: Kerivin, Herve Zhao, Jinhua CNRS LIMOS UMR 6158 F-63178 Aubiere France Cent China Normal Univ Fac Artificial Intelligence Educ Cent China Normal Univ Wollongong Joint Inst Wuhan 430079 Peoples R China
This paper contributes to the computational study of the Maximum-Weight Bounded-Degree Rooted Tree Problem. Based on previous work, two types of formulations are introduced for the problem, along with some newly disco... 详细信息
来源: 评论
A new formulation for the Weighted Safe Set Problem  11
A new formulation for the Weighted Safe Set Problem
收藏 引用
11th Latin and American algorithms, Graphs and Optimization Symposium (LAGOS)
作者: Malaguti, Enrico Pedrotti, Vagner Univ Bologna Dipartimento Ingn Energia Elettr & Informaz Gugli Bologna Italy Univ Fed Mato Grosso do Sul Fac Comp Campo Grande MS 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 connected ... 详细信息
来源: 评论
A Bilevel Model for Centralized Optimization of Charging Stops for EV on Highways  10th
A Bilevel Model for Centralized Optimization of Charging Sto...
收藏 引用
10th International Conference on Network Games, Control and Optimization (NetGCooP)
作者: Woznica, Anthony Quadri, Dominique Hayel, Yezekael Beaude, Olivier Univ Paris Sud Univ Paris Saclay LRI Bat 650 F-91405 Orsay France Univ Avignon 339 Chemin Meinajaries F-84911 Avignon 9 France EDF Lab Paris Saclay Palaiseau France
This paper addresses the multi-period problem of fixing the energy charging price at a set of charging stations deployed to support long journeys of electric vehicles along highways. In order to model the problem, we ... 详细信息
来源: 评论
Benders decomposition applied to profit maximizing hub location problem with incomplete hub network
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2022年 142卷 105715-105715页
作者: Oliveira, Fabricio Alves de Sa, Elisangela Martins de Souza, Sergio Ricardo Fed Inst Minas Gerais IFMG Rua Afonso Sardinha 90 BR-36420000 Ouro Branco MG Brazil Fed Ctr Technol Educ Minas Gerais CEFET MG Ave Amazonas 7675 BR-30510000 Belo Horizonte MG Brazil
This paper addresses a profit maximizing multiple allocation hub network design problem, which is a hub location problem with incomplete hub network, aiming to determine the quantity and location of the hubs, allocate... 详细信息
来源: 评论
A routing model and solution approach for alternative fuel vehicles with consideration of the fixed fueling time
收藏 引用
COMPUTERS & INDUSTRIAL ENGINEERING 2020年 142卷 106364-106364页
作者: Shao, Yihuan Dessouky, Maged Univ Southern Calif Daniel J Dept Ind & Syst Engn Los Angeles CA 90089 USA
In this paper, we introduce the Vehicle Routing Problem for Alternative Fuel Vehicles with Fixed Fueling Time (VRPAFVFFT) to model decisions to be made with regards to the vehicle routes cons, dering fuel stations. A ... 详细信息
来源: 评论
Models and algorithms for the Traveling Salesman Problem with Time-dependent Service times
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2020年 第3期283卷 825-843页
作者: Cacchiani, Valentina Contreras-Bolton, Carlos Toth, Paolo Univ Bologna DEI Viale Risorgimento 2 I-40136 Bologna Italy
The Traveling Salesman Problem with Time-dependent Service times (TSP-TS) is a generalization of the Asymmetric TSP, in which the service time at each customer is given by a (linear or quadratic) function of the corre... 详细信息
来源: 评论
A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints
收藏 引用
INFORMS JOURNAL ON COMPUTING 2020年 第1期32卷 120-134页
作者: Arslan, Okan Jabali, Ola Laporte, Gilbert HEC Montreal Montreal PQ H3T 2A7 Canada Politecn Milan Dipartimento Elettron Informaz & Bioingn I-20133 Milan Italy
Given a graph, a set of origin-destination (OD) pairs with communication requirements, and an integer k >= 2, the network design problem with vulnerability constraints (NDPVC) is to identify a subgraph with the min... 详细信息
来源: 评论
A multi-stage stochastic integer programming approach for a multi-echelon lot-sizing problem with returns and lost sales
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2020年 116卷 104865-000页
作者: Quezada, Franco Gicquel, Celine Kedad-Sidhoum, Safia Dong Quan Vu Sorbonne Univ CNRS Lab Informat Paris 6 F-75005 Paris France Univ Paris Saclay LRI F-91190 Gif Sur Yvette France CEDRIC CNAM F-75003 Paris France Nokia Paris Saclay Nokia Bell Labs Route Villejust F-91620 Nozay France
We consider an uncapacitated multi-item multi-echelon lot-sizing problem within a remanufacturing system involving three production echelons: disassembly, refurbishing and reassembly. We seek to plan the production ac... 详细信息
来源: 评论