標(biāo)題: Titlebook: Integration of AI and OR Techniques in Constraint Programming; 13th International C Claude-Guy Quimper Conference proceedings 2016 Springer [打印本頁(yè)] 作者: 正當(dāng)理由 時(shí)間: 2025-3-21 17:30
書目名稱Integration of AI and OR Techniques in Constraint Programming影響因子(影響力)
書目名稱Integration of AI and OR Techniques in Constraint Programming影響因子(影響力)學(xué)科排名
書目名稱Integration of AI and OR Techniques in Constraint Programming網(wǎng)絡(luò)公開(kāi)度
書目名稱Integration of AI and OR Techniques in Constraint Programming網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Integration of AI and OR Techniques in Constraint Programming被引頻次
書目名稱Integration of AI and OR Techniques in Constraint Programming被引頻次學(xué)科排名
書目名稱Integration of AI and OR Techniques in Constraint Programming年度引用
書目名稱Integration of AI and OR Techniques in Constraint Programming年度引用學(xué)科排名
書目名稱Integration of AI and OR Techniques in Constraint Programming讀者反饋
書目名稱Integration of AI and OR Techniques in Constraint Programming讀者反饋學(xué)科排名
作者: 散布 時(shí)間: 2025-3-21 21:00
Time-Series Constraints: Improvements and Application in CP and MIP Contexts,ence of values taken by the variables; such an automaton can also be used to decompose its specified constraint into a conjunction of logical constraints. The inference achieved by this decomposition in a CP solver can be boosted by automatically generated implied constraints on the accumulators, pr作者: TOXIN 時(shí)間: 2025-3-22 04:18
Finding a Collection of MUSes Incrementally, different preferences over these .. Typical . systems produce a single . without much control over which . is generated. In this paper we describe an algorithm that can efficiently compute a collection of ., thus presenting an application with a range of choices. Our algorithm improves over previou作者: 粗鄙的人 時(shí)間: 2025-3-22 06:25
Decomposition Based on Decision Diagrams, classical benchmarks. This success is primarily driven by a DDs ability to capture structure. This paper exploits this characteristic and proposes a novel solution method which decomposes a problem into highly-structured portions, where the solution set of each portion can be compactly represented 作者: 嚴(yán)厲批評(píng) 時(shí)間: 2025-3-22 09:47 作者: IRS 時(shí)間: 2025-3-22 15:01
Lagrangian Decomposition via Sub-problem Search,function can be inferred at each search node. The stronger the bound that can be inferred, the earlier failed subtrees can be detected, leading to an exponentially smaller search tree. Normal CP solvers are only capable of inferring a bound on the objective function via propagating the problem const作者: Cytokines 時(shí)間: 2025-3-22 19:14
Non-linear Optimization of Business Models in the Electricity Market,iberalization is opening new perspectives. This calls for the development of methodologies and tools that energy providers can use to define specific business models. In this work we develop an optimization model to provide recommendations on time-of-use based prices to providers, taking into accoun作者: 耐寒 時(shí)間: 2025-3-22 23:48
Weighted Spanning Tree Constraint with Explanations,rld applications are usually subject to constraints that do not let us apply such methods directly. In these cases we confront a version of the MST called the “Weighted Spanning Tree” (WST) in which we look for a spanning tree in a graph that satisfies other side constraints and is of minimum cost. 作者: Pituitary-Gland 時(shí)間: 2025-3-23 02:32
Forward-Checking Filtering for Nested Cardinality Constraints: Application to an Energy Cost-Aware et paper, kitchen rolls, facial tissues) is such an industry. Its production process is flexible enough to leverage partial planning reorganization allowing to reduce electricity consumption. The idea is to shift the production of the tissues (rolls) requiring more energy when electricity prices (fo作者: amorphous 時(shí)間: 2025-3-23 06:12 作者: Mhc-Molecule 時(shí)間: 2025-3-23 09:50 作者: Hyperalgesia 時(shí)間: 2025-3-23 16:42
Parallel Composition of Scheduling Solvers,brid solvers from high-level model specifications. This paper extends model combinators into the scheduling domain. This is of particular interest as, today, both Constraint Programming (CP) and Mixed-Integer Programming (MIP) perform well on scheduling problems providing different capabilities and 作者: Aqueous-Humor 時(shí)間: 2025-3-23 20:15 作者: Externalize 時(shí)間: 2025-3-24 01:17
Scheduling Home Hospice Care with Logic-Based Benders Decomposition,s to match hospice care aides with patients and schedule visits to patient homes, so as to maximize the number of patients serviced by available staff, while meeting requirements of the patient plan of care and scheduling constraints imposed by the patients and the staff. The Benders master problem 作者: cardiac-arrest 時(shí)間: 2025-3-24 06:16 作者: 愛(ài)國(guó)者 時(shí)間: 2025-3-24 06:44 作者: neoplasm 時(shí)間: 2025-3-24 12:39
Optimization Models for a Real-World Snow Plow Routing Problem,be cleared the better. Yet in most cities, plans for snowplowing are developed using simple allocation schemes that while easy to implement can also be quite inefficient. In this paper we consider the problem of optimizing the routes of a fleet of snow plowing vehicles, subject to street network top作者: allude 時(shí)間: 2025-3-24 18:55 作者: 滔滔不絕地說(shuō) 時(shí)間: 2025-3-24 20:47
A Stochastic Continuous Optimization Backend for MiniZinc with Applications to Geometrical Placemenmpare different solvers which are currently based on either Constraint Programming, Boolean satisfiability, Mixed Integer Linear Programming, and recently Local Search. In this paper we present a stochastic continuous optimization backend for MiniZinc models over real numbers. More specifically, we 作者: 珍奇 時(shí)間: 2025-3-25 00:24
dangerous time. He had loyally supported the policy of rearmament begun under Baldwin but was deeply concerned that the costs to be incurred, if the programs desired by the armed services were fully implemented, might be ruinous. At the same time, he was also conscious of the growth of the Axis war作者: CLAM 時(shí)間: 2025-3-25 03:29 作者: Thymus 時(shí)間: 2025-3-25 07:48 作者: anachronistic 時(shí)間: 2025-3-25 12:42 作者: Ascribe 時(shí)間: 2025-3-25 17:27
Geoffrey Chu,Graeme Gange,Peter J. Stuckeyotential competitors, moreover, had counted themselves out or had not yet become principals in the international reckoning. France, torn by dissension, did not fully recover under Louis Napoleon. The Crimean War (1854–56), a product of diplomatic miscalculations, created crises of confidence for Bri作者: 籠子 時(shí)間: 2025-3-25 20:30 作者: seduce 時(shí)間: 2025-3-26 01:11 作者: 招致 時(shí)間: 2025-3-26 06:30 作者: 取之不竭 時(shí)間: 2025-3-26 08:58 作者: buoyant 時(shí)間: 2025-3-26 16:36 作者: 發(fā)電機(jī) 時(shí)間: 2025-3-26 17:26
Daniel Fontaine,Laurent Michel,Pascal Van Hentenryck between the two world wars, it is too easy to forget that the late nineteenth century was also a period of dramatic economic and social change. In the last quarter of the nineteenth century, for the first time, a British industrial economy which depended overwhelmingly on exports was faced with maj作者: peptic-ulcer 時(shí)間: 2025-3-26 22:21 作者: jealousy 時(shí)間: 2025-3-27 01:23
Aliza Heching,John N. Hooker births per thousand of the population over a given period of time (normally a year). Such a rate is a function of three main variables: the ratio of births to women of child-bearing age; the ratio of women of child-bearing age to the total population; and the proportion of women of childbearing age作者: 材料等 時(shí)間: 2025-3-27 09:21
Amina Kemmar,Samir Loudni,Yahia Lebbah,Patrice Boizumault,Thierry Charnois births per thousand of the population over a given period of time (normally a year). Such a rate is a function of three main variables: the ratio of births to women of child-bearing age; the ratio of women of child-bearing age to the total population; and the proportion of women of childbearing age作者: essential-fats 時(shí)間: 2025-3-27 13:10
Gilles Madi Wamba,Nicolas Beldiceanu evident in previous research. As there has only been a limited amount of research on epicene pronouns in the last 10–20 years, with most works drawing upon studies that are even older than this, the topic had become stale. One potential reason for this state of affairs is that the many studies on e作者: 支形吊燈 時(shí)間: 2025-3-27 14:27
Thierry Martinez,Fran?ois Fages,Abder Aggountinction between the first-person forms used for the speaker/ writer (referred to as ., and .) and the forms used for their addressee(s) (., and .) which constitute the second person. Finally, the third-person pronouns (., and .) refer to participants external to interaction. Unusually for the Engli作者: 無(wú)意 時(shí)間: 2025-3-27 18:47 作者: breadth 時(shí)間: 2025-3-27 23:08
978-3-319-33953-5Springer International Publishing Switzerland 2016作者: 驚奇 時(shí)間: 2025-3-28 05:20
Integration of AI and OR Techniques in Constraint Programming978-3-319-33954-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: CLASP 時(shí)間: 2025-3-28 09:19 作者: 減少 時(shí)間: 2025-3-28 13:45
Claude-Guy QuimperIncludes supplementary material: 作者: infantile 時(shí)間: 2025-3-28 15:12
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/i/image/468814.jpg作者: Conducive 時(shí)間: 2025-3-28 22:22
Conference proceedings 2016rovides an opportunity for researchers in one area to learn about techniques in the others, and to show how the integration of techniques from different fields can lead to interesting results on large and complex problems..作者: Dappled 時(shí)間: 2025-3-29 02:04
0302-9743 cations in combinatorial optimization and provides an opportunity for researchers in one area to learn about techniques in the others, and to show how the integration of techniques from different fields can lead to interesting results on large and complex problems..978-3-319-33953-5978-3-319-33954-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 惡心 時(shí)間: 2025-3-29 07:06
Scheduling Home Hospice Care with Logic-Based Benders Decomposition,r hospice care provider. We find that LBBD is superior to state-of-the-art MIP and solves problems of realistic size, if the aim is to conduct staff planning on a rolling basis while maintaining continuity of the care arrangement for patients currently receiving service.作者: NEX 時(shí)間: 2025-3-29 08:56
0302-9743 telligence and Operations Research Techniques in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2016, held in Banff, Canada, in May/June 2016...The 21 full papers presented together with 8 short papers were carefully reviewed and selected from 51 submissions. The conference b作者: 變形 時(shí)間: 2025-3-29 12:38
Conference proceedings 2016es in Constraint Programming for Combinatorial Optimization Problems, CPAIOR 2016, held in Banff, Canada, in May/June 2016...The 21 full papers presented together with 8 short papers were carefully reviewed and selected from 51 submissions. The conference brings together interested researchers from 作者: Lamina 時(shí)間: 2025-3-29 18:56
Logic-Based Decomposition Methods for the Travelling Purchaser Problem,finding optimal solutions to previously unsolved instances, while performing competitively on a number of symmetric problem classes. Furthermore, our model is implemented unchanged for the four problem variants whereas other state-of-the-art approaches are variant-specific.作者: 暗語(yǔ) 時(shí)間: 2025-3-29 20:10
Non-linear Optimization of Business Models in the Electricity Market,d population information. The main advantage of the model is that it provides a tool for sensitivity analysis, namely for understanding the impact of economical and behavioral parameters on the consumption profiles.作者: saturated-fat 時(shí)間: 2025-3-30 01:57 作者: entrance 時(shí)間: 2025-3-30 05:21
Parallelizing Constraint Programming with Learning,t is not clear which approach to parallelization is likely to be most effective. We give examples of very different kinds of optimization problems we wish to parallelize and show that a hybrid approach to parallelization can provide a robust and high performing parallel LCG solver.作者: 虛弱的神經(jīng) 時(shí)間: 2025-3-30 11:22 作者: Morbid 時(shí)間: 2025-3-30 14:16 作者: 公司 時(shí)間: 2025-3-30 19:56
A Stochastic Continuous Optimization Backend for MiniZinc with Applications to Geometrical Placementation Evolution Strategy (CMA-ES) solver. We illustrate this approach with the declarative modeling and solving of hard geometrical placement problems, motivated by packing applications in logistics involving mixed square-curved shapes and complex shapes defined by Bézier curves.作者: 即席 時(shí)間: 2025-3-30 23:46
Finding a Collection of MUSes Incrementally,s methods for finding multiple . by computing its . incrementally. This allows it to generate multiple . more efficiently; making it more feasible to supply applications with a collection of . rather than just one.作者: CALL 時(shí)間: 2025-3-31 03:27
Decomposition Based on Decision Diagrams,using a DD. This technique is applied to a special case of the independent set problem and to unconstrained binary quadratic programming. Preliminary computational results suggest that the proposed decomposition approach can improve upon both standard integer programming models and a single DD approach.作者: 過(guò)度 時(shí)間: 2025-3-31 08:06
Weighted Spanning Tree Constraint with Explanations,In this paper we implement this constraint using a lower bound and learning to accelerate the search and thus reduce the solving time. We show that having this propagator is tremendously beneficial for solvers and we show the benefits of learning.作者: 劇本 時(shí)間: 2025-3-31 11:53 作者: 喧鬧 時(shí)間: 2025-3-31 17:14
A Reservoir Balancing Constraint with Applications to Bike-Sharing,ulting CP approach outperforms a Branch-and-Bound approach derived from two closely related problems. In addition, the CP approach presented in this paper resulted in a first place position in the competition.作者: Frisky 時(shí)間: 2025-3-31 18:37 作者: 廢除 時(shí)間: 2025-4-1 01:44 作者: CORE 時(shí)間: 2025-4-1 03:58 作者: 變量 時(shí)間: 2025-4-1 09:19
Forward-Checking Filtering for Nested Cardinality Constraints: Application to an Energy Cost-Aware should rather be modeled using the global . constraint introduced by Zanarini and Pesant. Unfortunately it is well known that the GAC propagation does not always pay off in practice for cardinality constraints when compared to lighter Forward-Checking (FWC) algorithms. We introduce a preprocessing s作者: 投票 時(shí)間: 2025-4-1 12:18
Optimization Models for a Real-World Snow Plow Routing Problem,g Open Streets map data of Pittsburgh PA. Experimental results are presented that illustrate the differential strengths and weaknesses of each model, and suggest an alternative hybrid solution approach.作者: 雪上輕舟飛過(guò) 時(shí)間: 2025-4-1 14:54
