检索结果-内蒙古大学图书馆

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

705 篇 会议
21 篇 期刊文献
5 册 图书

馆藏范围

729 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

539 篇 工学
- 460 篇 计算机科学与技术...
- 123 篇 软件工程
- 84 篇 电气工程
- 44 篇 信息与通信工程
- 39 篇 控制科学与工程
- 13 篇 机械工程
- 9 篇 生物工程
- 8 篇 电子科学与技术（可...
- 8 篇 化学工程与技术
- 8 篇 交通运输工程
- 6 篇 环境科学与工程（可...
- 5 篇 仪器科学与技术
- 5 篇 冶金工程
- 5 篇 安全科学与工程
- 4 篇 光学工程
- 4 篇 动力工程及工程热...
- 4 篇 水利工程
- 4 篇 石油与天然气工程
341 篇 理学
- 322 篇 数学
- 43 篇 系统科学
- 14 篇 生物学
- 12 篇 物理学
- 11 篇 统计学（可授理学、...
- 4 篇 化学
165 篇 管理学
- 158 篇 管理科学与工程(可...
- 44 篇 工商管理
18 篇 经济学
- 16 篇 应用经济学
6 篇 医学
- 4 篇 基础医学(可授医学...
- 4 篇 临床医学
4 篇 法学
- 4 篇 社会学
2 篇 教育学
2 篇 文学
2 篇 农学

主题

195 篇 integer programm...
88 篇 combinatorial op...
61 篇 optimization
59 篇 linear programmi...
23 篇 integer linear p...
16 篇 mixed integer pr...
14 篇 approximation al...
14 篇 dynamic programm...
13 篇 mixed-integer pr...
13 篇 combinatorial ma...
12 篇 mixed integer li...
12 篇 scheduling
11 篇 computational mo...
11 篇 constraint progr...
10 篇 mixed-integer li...
10 篇 mathematical pro...
10 篇 mathematical mod...
8 篇 genetic algorith...
8 篇 cutting planes
8 篇 semidefinite pro...

机构

8 篇 carnegie mellon ...
6 篇 georgia inst tec...
5 篇 department of co...
4 篇 univ bologna dei...
4 篇 ibm tj watson re...
4 篇 max planck inst ...
4 篇 mit cambridge ma...
4 篇 carnegie mellon ...
4 篇 department of co...
3 篇 mit alfred p slo...
3 篇 univ florida ind...
3 篇 zuse inst berlin...
3 篇 school of indust...
3 篇 univ wisconsin d...
3 篇 univ padua dipar...
3 篇 brown univ dept ...
3 篇 school of indust...
3 篇 univ pittsburgh ...
3 篇 georgia inst tec...
3 篇 mit 77 massachus...

作者

8 篇 nemhauser george...
7 篇 lodi andrea
7 篇 conforti michele
6 篇 weismantel rober...
6 篇 basu amitabh
5 篇 rousseau louis-m...
5 篇 woeginger gerhar...
5 篇 dilkina bistra
5 篇 van hoeve willem...
5 篇 linderoth jeff
5 篇 vielma juan pabl...
5 篇 balas egon
5 篇 dey santanu s.
5 篇 fischetti matteo
4 篇 munoz gonzalo
4 篇 bienstock daniel
4 篇 cornuéjols gérar...
4 篇 fukasawa ricardo
4 篇 raidl guenther r...
4 篇 dash sanjeeb

语言

722 篇 英文
5 篇 其他
4 篇 中文

检索条件"任意字段=13th International Conference on Integer Programming and Combinatorial Optimization"

共 731 条记录，以下是181-190 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

Delivery Scope: A New Way of Restaurant Retrieval For On-demand Food Delivery Service 20

Delivery Scope: A New Way of Restaurant Retrieval For On-dem...

引用

26th ACM SIGKDD international conference on Knowledge Discovery and Data Mining (KDD)

作者： Ding, Xuetao Zhang, Runfeng Mao, Zhen Xing, Ke Du, Fangxiao Liu, Xingyu Wei, Guoxing Yin, Feifan He, Renqing Sun, Zhizhao Meituan Dianping Grp Beijing Peoples R China

ISBN: (纸本)9781450379984

Recently on-demand food delivery service has become very popular in China. More than 30 million orders are placed by eaters of Meituan-Dianping everyday. Delicacies are delivered to eaters in 30 minutes on average. To fully leverage the ability of our couriers and restaurants, delivery scope is proposed as an infrastructure product for on-demand food delivery area. A delivery scope based retrieval system is designed and built on our platform. In order to draw suitable delivery scopes for millions of restaurant partners, we propose a pioneering delivery scope generation framework. In our framework, a single delivery scope generation algorithm is proposed by using spatial computational techniques and data mining techniques. Moreover, a scope scoring algorithm and decision algorithm are proposed by utilizing machine learning models and combinatorial optimization techniques. Specifically, we propose a novel delivery scope sample generation method and use the scope related features to estimate order numbers and average delivery time in a period of time for each delivery scope. then we formalize the candidate scopes selection process as a binary integer programming problem. Both branch&bound algorithm and a heuristic search algorithm are integrated in our system. Results of online experiments show that scopes generated by our new algorithm significantly outperform manual generated ones. Our algorithm brings more orders without hurt of users' experience. After deployed online, our system has saved thousands of hours for operation staff, and it is considered to be one of the most useful operation tools to balance demand of eaters and supply of restaurants and couriers.

关键词： location-based retrieval on-demand food delivery spatial computation machine learning combinational optimization

来源：评论

学校读者我要写书评

暂无评论

Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time 20th

Computing the Nucleolus of Weighted Cooperative Matching Gam...

引用

20th international conference on integer programming and combinatorial optimization (IPCO)

作者： Konemann, Jochen Pashkovich, Kanstantsin Toth, Justin Univ Waterloo Waterloo ON N2L 3G1 Canada Univ Ottawa Ottawa ON K1N 6N5 Canada

We provide an efficient algorithm for computing the nucleolus for an instance of a weighted cooperative matching game. this resolves a long-standing open question posed in [Faigle, Kern, Fekete, Hochstattler, Mathemat... 详细信息

ISBN: (纸本)9783030179533;9783030179526

关键词： combinatorial optimization Algorithmic game theory Matchings

来源：评论

学校读者我要写书评

暂无评论

optimization of the Use of Critical Resources in the Development of Offshore Oil Fields 20th

Optimization of the Use of Critical Resources in the Develop...

引用

20th international conference on Computational Science and Its Applications (ICCSA)

作者： Bassi, Sergio Ronconi, Debora Pretti Univ Sao Paulo Prod Engn Dept BR-05508010 Sao Paulo Brazil

ISBN: (纸本)9783030587994;9783030587987

this paper focuses on a real case of connection of subsea oil wells to offshore platforms using pipe laying support vessels. the objective of this study is to maximize the oil production curve through an optimized use of the out-sourced fleet. Specific features of this scenario are considered, such as technical constraints of each vessel, the availability of the vessels, materials for connection, and the end of the previous phase, called completion. A mixed integer linear programming model is developed considering several constraints that structure this complex situation, among which a relevant characteristic of the problem: the increase of the production curve using injection wells to fight the natural decline of producing wells over time. this mathematical model was tested in small computational instances, showing adequate behavior, which demonstrates that it faithfully represents the situation portrayed and can be used, combined with more advanced computational resources, to achieve better results.

关键词： Oil wells Routing problem Mixed integer linear programming

来源：评论

学校读者我要写书评

暂无评论

On Idle Energy Consumption Minimization in Production: Industrial Example and Mathematical Model 9th

On Idle Energy Consumption Minimization in Production: Indus...

引用

9th international conference on Operations Research and Enterprise Systems (ICORES)

作者： Benedikt, Ondrej Sucha, Premysl Hanzalek, Zdenek Czech Tech Univ Czech Inst Informat Robot & Cybernet Jugoslavskych Partyzanu 1580-3 Prague Czech Republic Czech Tech Univ Fac Elect Engn Dept Control Engn Karlovo Namesti 13 Prague Czech Republic

ISBN: (纸本)9789897583964

this paper, inspired by a real production process of steel hardening, investigates a scheduling problem to minimize the idle energy consumption of machines. the energy minimization is achieved by switching a machine to some power-saving mode when it is idle. For the steel hardening process, the mode of the machine (i.e., furnace) can be associated with its inner temperature. Contrary to the recent methods, which consider only a small number of machine modes, the temperature in the furnace can be changed continuously, and so an infinite number of the power-saving modes must be considered to achieve the highest possible savings. To model the machine modes efficiently, we use the concept of the energy function, which was originally introduced in the domain of embedded systems but has yet to take roots in the domain of production research. the energy function is illustrated with several application examples from the literature. Afterward, it is integrated into a mathematical model of a scheduling problem with parallel identical machines and jobs characterized by release times, deadlines, and processing times. Numerical experiments show that the proposed model outperforms a reference model adapted from the literature.

关键词： Scheduling Energy optimization Operation Modes Mixed integer Linear programming Parallel Machines

来源：评论

学校读者我要写书评

暂无评论

Identically Self-blocking Clutters 1

引用

20th international conference on integer programming and combinatorial optimization (IPCO)

作者： Abdi, Ahmad Cornuejols, Gerard Lee, Dabeen Carnegie Mellon Univ Tepper Sch Business Pittsburgh PA 15213 USA

A clutter is identically self-blocking if it is equal to its blocker. We prove that every identically self-blocking clutter different from {{a}} is nonideal. Our proofs borrow tools from Gauge Duality and Quadratic Pr... 详细信息

ISBN: (数字)9783030179533

ISBN: (纸本)9783030179533;9783030179526

关键词： Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

Sparsity of integer Solutions in the Average Case 20th

Sparsity of Integer Solutions in the Average Case

引用

20th international conference on integer programming and combinatorial optimization (IPCO)

作者： Oertel, Timm Paat, Joseph Weismantel, Robert Cardiff Univ Sch Math Cardiff S Glam Wales Swiss Fed Inst Technol Inst Operat Res Zurich Switzerland

ISBN: (纸本)9783030179533;9783030179526

We examine how sparse feasible solutions of integer programs are, on average. Average case here means that we fix the constraint matrix and vary the right-hand side vectors. For a problem in standard form with m equations, there exist LP feasible solutions with at most m many nonzero entries. We show that under relatively mild assumptions, integer programs in standard form have feasible solutions with O(m) many nonzero entries, on average. Our proof uses ideas from the theory of groups, lattices, and Ehrhart polynomials. From our main theorem we obtain the best known upper bounds on the integer Caratheodory number provided that the determinants in the data are small.

关键词： integer programming

来源：评论

学校读者我要写书评

暂无评论

Intersection Cuts for Factorable MINLP 20th

Intersection Cuts for Factorable MINLP

引用

20th international conference on integer programming and combinatorial optimization (IPCO)

作者： Serrano, Felipe Zuse Inst Berlin Optimizat Dept Takustr 7 D-14195 Berlin Germany

ISBN: (纸本)9783030179533;9783030179526

Given a factorable function f, we propose a procedure that constructs a concave underestimator of f that is tight at a given point. these underestimators can be used to generate intersection cuts. A peculiarity of these underestimators is that they do not rely on a bounded domain. We propose a strengthening procedure for the intersection cuts that exploits the bounds of the domain. Finally, we propose an extension of monoidal strengthening to take advantage of the integrality of the non-basic variables.

关键词： Mixed-integer nonlinear programming Intersection cuts Monoidal strengthening

来源：评论

学校读者我要写书评

暂无评论

Sub-Symmetry-Breaking Inequalities for ILP with Structured Symmetry 1

引用

20th international conference on integer programming and combinatorial optimization (IPCO)

作者： Bendotti, Pascale Fouilhoux, Pierre Rottner, Cecile Sorbonne Univ CNRS 7606 LIP6 Paris France EDF R&D Palaiseau France

ISBN: (数字)9783030179533

ISBN: (纸本)9783030179533;9783030179526

We consider integer linear programs whose solutions are binary matrices and whose (sub-)symmetry groups are symmetric groups acting on (sub-)columns. We propose a framework to build (sub-)symmetry-breaking inequalities for such programs, by introducing one additional variable per sub-symmetry group considered. the proposed framework is applied to derive inequalities breaking both symmetries and sub-symmetries in the graph coloring problem and in the ramp constrained min-up/min-down unit commitment problem.

关键词： integer linear programming (Sub)-symmetry breaking inequalities Graph Coloring Problem Unit Commitment Problem

来源：评论

学校读者我要写书评

暂无评论

Multi-label Classification for the Generation of Sub-problems in Time-constrained combinatorial optimization 8th

Multi-label Classification for the Generation of Sub-problem...

引用

8th international conference on Operations Research and Enterprise Systems (ICORES)

作者： Mossina, Luca Rachelson, Emmanuel Delahaye, Daniel Univ Toulouse ISAE SUPAERO Toulouse France Univ Toulouse ENAC Toulouse France

ISBN: (纸本)9789897583520

this paper addresses the resolution of combinatorial optimization problems presenting some kind of recurrent structure, coupled with machine learning techniques. Stemming from the assumption that such recurrent problems are the realization of an unknown generative probabilistic model, data is collected from previous resolutions of such problems and used to train a supervised learning model for multi-label classification. this model is exploited to predict a subset of decision variables to be set heuristically to a certain reference value, thus becoming fixed parameters in the original problem. the remaining variables then form a smaller subproblem whose solution, while not guaranteed to be optimal for the original problem, can be obtained faster, offering an advantageous tool for tackling time-sensitive tasks.

关键词： Multi-label Classification Mixed integer Linear programming combinatorial optimization Recurrent Problems Machine Learning

来源：评论

学校读者我要写书评

暂无评论

An Exact Algorithm for Robust Influence Maximization 20th

An Exact Algorithm for Robust Influence Maximization

引用

20th international conference on integer programming and combinatorial optimization (IPCO)

作者： Nannicini, Giacomo Sartor, Giorgio Traversi, Emiliano Wolfler-Calvo, Roberto IBM TJ Watson Res Ctr Yorktown Hts NY 10598 USA SINTEF Digital Oslo Norway Univ Paris 13 LIPN Villetaneuse France Univ Cagliari Dept Math & Comp Sci Cagliari Italy

ISBN: (纸本)9783030179533;9783030179526

We propose a Branch-and-Cut algorithm for the robust influence maximization problem. the influence maximization problem aims to identify, in a social network, a set of given cardinality comprising actors that are able to influence the maximum number of other actors. We assume that the social network is given in the form of a graph with node thresholds to indicate the resistance of an actor to influence, and arc weights to represent the strength of the influence between two actors. In the robust version of the problem that we study, the node thresholds are affected by uncertainty and we optimize over a worst-case scenario within a given robustness budget. Numerical experiments show that we are able to solve to optimality instances of size comparable to other exact approaches in the literature for the non-robust problem, but in addition to this we can also tackle the robust version with similar performance.

关键词： Influence maximization integer programming Robust optimization

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共74页 << < 15 16 17 18 19 20 21 22 23 24 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：