In this work we propose a Variable Neighborhood Search (VNS) approach for the long-term maintenance programming of an iron ore processing plant of a company in Brazil. the problem is a complex maintenance programming ...
详细信息
In this study, one variant of multi-product scheduling problem is considered. the problem asks to find the optimal selection of a set of tasks to produce a given number of products in required amounts, to allocate the...
详细信息
the proceedings contain 35 papers. the special focus in this conference is on combinatorialoptimization. the topics include: Online firefighting on trees;a multigraph formulation for the generalized minimum spanning ...
ISBN:
(纸本)9783319961507
the proceedings contain 35 papers. the special focus in this conference is on combinatorialoptimization. the topics include: Online firefighting on trees;a multigraph formulation for the generalized minimum spanning tree problem;the distance polytope for the vertex coloring problem;A PTAS for the time-invariant incremental knapsack problem;on bounded pitch inequalities for the min-knapsack polytope;Efficient algorithms for measuring the funnel-likeness of DAGs;jointly optimizing replica placement, requests distribution and server storage capacity on content distribution networks;an exact column generation-based algorithm for bi-objective vehicle routing problems;multi-start local search procedure for the maximum fire risk insured capital problem;Compact MILP formulations for the p-center problem;a branch-and-bound procedure for the robust cyclic job shop problem;an exact algorithm for the split-demand one-commodity pickup-and-delivery travelling salesman problem;descent with mutations applied to the linear ordering problem;characterization and approximation of strong general dual feasible functions;preemptively guessing the center;improved algorithms for k-domination and total k-domination in proper interval graphs;A heuristic for maximising energy efficiency in an OFDMA system subject to QoS constraints;an integerprogramming approach to the student-project allocation problem with preferences over projects;even flying cops should think ahead;a generalization of the minimum branch vertices spanning tree problem;the next release problem: Complexity, exact algorithms and computations;a polyhedral view to generalized multiple domination and limited packing;alternating current optimal power flow with generator selection;parameterized algorithms for module map problems;2 CSPs all are approximable within a constant differential factor.
Following the seminal work of Padberg on the Boolean quadric polytope BQP and its LP relaxation BQPLP, we consider a natural extension: the polytopes SATP and SATPLP, with BQPLP being a projection of SATPLP face (and ...
详细信息
One main concern of voting theory is to determine a procedure for choosing a winner from among a set of candidates, based on the preferences of the voters or, more ambitiously, for ranking all the candidates or a part...
详细信息
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical" knapsack problem is drastic...
详细信息
ISBN:
(数字)9783319592503
ISBN:
(纸本)9783319592503;9783319592497
We obtain optimal lower and upper bounds for the (additive) integrality gaps of integer knapsack problems. In a randomised setting, we show that the integrality gap of a "typical" knapsack problem is drastically smaller than the integrality gap that occurs in a worst case scenario.
We extend the Barvinok-Woods algorithm for enumeration of integer points in projections of polytopes to unbounded polyhedra. To achieve this, we employ a new structural result on projections of semilinear subsets of t...
详细信息
ISBN:
(纸本)9783319592503;9783319592497
We extend the Barvinok-Woods algorithm for enumeration of integer points in projections of polytopes to unbounded polyhedra. To achieve this, we employ a new structural result on projections of semilinear subsets of the integer lattice.
this paper studies the quayside operation problem, in which three seaside planning decisions are integrated, withthe objective of minimizing the maximum relative tardiness. A refinement of the state-of-the-art formul...
详细信息
this paper studies the quayside operation problem, in which three seaside planning decisions are integrated, withthe objective of minimizing the maximum relative tardiness. A refinement of the state-of-the-art formulation is presented in this work, and an improved exact combinatorial Benders decomposition algorithm is devised for the problem at container terminals which used to be typically modeled by mixed-integer linear programming problems containing a large number of “big-M” coefficients.
Knowledge graphs are networks with annotated nodes and edges, representing different relations between the network nodes. Learning from such graphs is becoming increasingly important as numerous real-life systems can ...
详细信息
ISBN:
(数字)9783319999609
ISBN:
(纸本)9783319999609;9783319999593
Knowledge graphs are networks with annotated nodes and edges, representing different relations between the network nodes. Learning from such graphs is becoming increasingly important as numerous real-life systems can be represented as knowledge graphs, where properties of selected types of nodes or edges are learned. this paper presents a fully autonomous approach to targeted knowledge graph decomposition, advancing the state-of-the-art HINMINE network decomposition methodology. In this methodology, weighted edges between the nodes of a selected node type are constructed via different typed triplets, each connecting two nodes of the same type through an intermediary node of a different type. the final product of such a decomposition is a weighted homogeneous network of the selected node type. HINMINE is advanced by reformulating the supervised network decomposition problem as a combinatorialoptimization problem, and by solving it by a differential evolution approach. the proposed approach is tested on node classification tasks on two real-life knowledge graphs. the experimental results demonstrate that the proposed end-to-end learning approach is much faster and as accurate as the exhaustive search approach.
this paper addresses the energy management of large-scale urban street lighting systems. We propose a multi-stage decision-making procedure that supports the energy manager in determining the optimal energy retrofit p...
详细信息
ISBN:
(纸本)9781509067817
this paper addresses the energy management of large-scale urban street lighting systems. We propose a multi-stage decision-making procedure that supports the energy manager in determining the optimal energy retrofit plan of an existing public street lighting system. the problem statement is based on a quadratic integerprogramming formulation and aims at simultaneously reducing the energy consumption, ensuring an optimal allocation of the retrofit actions, and efficiently using the available budget. the proposed solution relies on a decentralized optimization algorithm that is based on discrete dynamic programming. the methodology is applied to a real street lighting system in the city of Bari, Italy.
暂无评论