咨询与建议

限定检索结果

文献类型

  • 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 条 记 录,以下是71-80 订阅
排序:
The traveling salesman problem with pickup and delivery: polyhedral results and a branch-and-cut algorithm
收藏 引用
MATHEMATICAL PROGRAMMING 2010年 第2期121卷 269-305页
作者: Dumitrescu, Irina Ropke, Stefan Cordeau, Jean-Francois Laporte, Gilbert HEC Montreal Canada Res Chair Distribut Management Montreal PQ H3T 2A7 Canada Univ Sydney Sch Math & Stat Sydney NSW 2052 Australia HEC Montreal Canada Res Chair Logist & Transportat Montreal PQ H3T 2A7 Canada
The Traveling Salesman Problem with Pickup and Delivery (TSPPD) is defined on a graph containing pickup and delivery vertices between which there exists a one-to-one relationship. The problem consists of determining a... 详细信息
来源: 评论
A disaster evacuation network model for transporting multiple priority evacuees
收藏 引用
IIE TRANSACTIONS 2015年 第11期47卷 1287-1299页
作者: Na, Hyeong Suk Banerjee, Amarnath Texas A&M Univ Dept Ind & Syst Engn College Stn TX 77843 USA
There is an increasing number of natural disasters occurring worldwide, particularly in populated areas. These events affect a large number of people, causing injuries and fatalities. Providing rapid medical treatment... 详细信息
来源: 评论
The Stacker Crane Problem and the Directed General Routing Problem
收藏 引用
NETWORKS 2015年 第1期65卷 43-55页
作者: Avila, Thais Corberan, Angel Plana, Isaac Sanchis, Jose M. Univ Valencia Dept Estadist & Invest Operat Valencia Spain Univ Politecn Valencia Dept Matemat Aplicada E-46071 Valencia Spain
In this article, we deal with the polyhedral description and the resolution of the directed general routing problem (DGRP) and the stacker crane problem (SCP). The DGRP, in which the service activity occurs both at so... 详细信息
来源: 评论
Minimum edge blocker dominating set problem
收藏 引用
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH 2015年 第1期247卷 16-26页
作者: Pajouh, Foad Mahdavi Walteros, Jose L. Boginski, Vladimir Pasiliao, Eduardo L. Univ Massachusetts Management Sci & Informat Syst Dept Boston MA 02125 USA SUNY Buffalo Dept Ind & Syst Engn Buffalo NY 14260 USA Univ Florida Dept Ind & Syst Engn Gainesville FL 32611 USA Air Force Res Lab Munit Directorate Eglin AFB FL 32542 USA
This paper introduces and studies the minimum edge blocker dominating set problem (EBDP), which is formulated as follows. Given a vertex-weighted undirected graph and r> 0, remove a minimum number of edges so that ... 详细信息
来源: 评论
A Heuristic Method Based on the branch and cut algorithm to the Transmission System Expansion Planning Problem
A Heuristic Method Based on the Branch and Cut Algorithm to ...
收藏 引用
IEEE Power and Energy Society General Meeting
作者: Aldir S. Sousa Eduardo N. Asada Department of Electrical Engineering Sao Carlos School of Engineering University of Sao Paulo
In this paper we introduce a new heuristic algorithm to the centralized long-term transmission system expansion planning problem. The proposed method introduces cuts (new constraints) to the mathematical model to forc... 详细信息
来源: 评论
A branch-AND-cut FOR THE NON-DISJOINT m-RING-STAR PROBLEM
收藏 引用
RAIRO-OPERATIONS RESEARCH 2014年 第2期48卷 167-188页
作者: Fouilhoux, Pierre Questel, Auralien Univ Paris 06 Lab LIP6 F-75005 Paris France
In this article we study the realistic network topology of Synchronous Digital Hierarchy (SDH) networks. We describe how providers fulfill customer connectivity requirements. We show that SDH Network design reduces to... 详细信息
来源: 评论
Optimal joint replenishment, delivery and inventory management policies for perishable products
收藏 引用
COMPUTERS & OPERATIONS RESEARCH 2014年 第Jul.期47卷 42-52页
作者: Coelho, Leandro C. Laporte, Gilbert CIRRELT Interuniv Res Ctr Enterprise Networks Log Toronto ON Canada Univ Laval Fac Sci Adm Quebec City PQ G1K 0A6 Canada HEC Montreal Montreal PQ H3T 2A7 Canada
In this paper we analyze the optimal joint decisions of when, how and how much to replenish customers with products of varying ages. We discuss the main features of the problem arising in the joint replenishment and d... 详细信息
来源: 评论
Exact and meta-heuristic approach for a general heterogeneous dial-a-ride problem with multiple depots
收藏 引用
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL 2014年 67卷 166-186页
作者: Braekers, Kris Caris, An Janssens, Gerrit K. Hasselt Univ Res Grp Logist B-3590 Diepenbeek Belgium Res Fdn Flanders FWO B-1000 Brussels Belgium
Dial-a-ride problems are concerned with the design of efficient vehicle routes for transporting individual persons from specific origin to specific destination locations. In real-life this operational planning problem... 详细信息
来源: 评论
Solving the Close-Enough Arc Routing Problem
收藏 引用
NETWORKS 2014年 第1期63卷 107-118页
作者: Minh Hoang Ha Bostel, Nathalie Langevin, Andre Rousseau, Louis-Martin LUNAM Univ IRCCyN F-44307 Nantes 3 France Ecole Mines Nantes IRCCyN F-44307 Nantes 3 France Ecole Polytech Dept Math & Ind Engn Montreal PQ H3C 3A7 Canada Ecole Polytech CIRRELT Montreal PQ H3C 3A7 Canada LUNAM Univ IRCCyN F-44606 St Nazaire France Univ Nantes F-44606 St Nazaire France
The close-enough arc routing problem has an interesting real-life application to routing for meter reading. In this article, we propose a new mathematical formulation for this problem. We analyze our formulation and c... 详细信息
来源: 评论
Formulations for an inventory routing problem
收藏 引用
INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH 2014年 第3期21卷 353-374页
作者: Archetti, Claudia Bianchessi, Nicola Irnich, Stefan Speranza, M. Grazia Univ Brescia Dept Econ & Management Brescia Italy Johannes Gutenberg Univ Mainz Chair Logist Management D-55122 Mainz Germany
In this paper, we present and compare formulations for the inventory routing problem (IRP) where the demand of customers has to be served, over a discrete time horizon, by capacitated vehicles starting and ending thei... 详细信息
来源: 评论