Results 31 to 40 of about 284 (55)
Ten years of feasibility pump, and counting
EURO Journal on Computational Optimization, 2019 The Feasibility Pump (fp) is probably the best-known primal heuristic for mixed-integer programming. The original work by Fischetti et al. (Math Program 104(1):91–104, 2005), which introduced the heuristic for 0–1 mixed-integer linear programs, has been ...
Timo Berthold +2 more
doaj
EURO Journal on Computational Optimization, 2017 One challenge for social network researchers is to evaluate balance in a social network. The degree of balance in a social group can be used as a tool to study whether and how this group evolves to a possible balanced state.
Mario Levorato +3 more
doaj
Construction of near-optimal vertex clique covering for real-world networks [PDF]
, 2015 We propose a method based on combining a constructive and a bounding heuristic to solve the vertex clique covering problem (CCP), where the aim is to partition the vertices of a graph into the smallest number of classes, which induce cliques.
Chalupa, David
core
Matching with Couples: a Multidisciplinary Survey [PDF]
This survey deals with two-sided matching markets where one set of agents (workers/residents) has to be matched with another set of agents (firms/hospitals). We first give a short overview of a selection of classical results.
Flip Klijn, Peter Biro
core
Matheuristics for optimizing the network in German wagonload traffic
EURO Journal on Computational Optimization, 2017 In this paper, we consider a capacitated multiple allocation hub location problem derived from a practical application in network design of German wagonload traffic.
Julia Sender +3 more
doaj
Ensemble methods of classification for power systems security assessment
Applied Computing and Informatics, 2019 One of the most promising approaches for complex technical systems analysis employs ensemble methods of classification. Ensemble methods enable a reliable decision rules construction for feature space classification in the presence of many possible ...
A. Zhukov +5 more
doaj
Solving the minimum labelling spanning tree problem using hybrid local search [PDF]
, 2007 Given a connected, undirected graph whose edges are labelled (or coloured), the minimum labelling spanning tree (MLST) problem seeks a spanning tree whose edges have the smallest number of distinct labels (or colours).
Consoli, S +3 more
core
A new algorithm for the 2-period Balanced Traveling Salesman Problem in Euclidean graphs [PDF]
In a previous paper, we proposed two heuristic algorithms for the euclidean 2-period Balanced Travelling Salesman Problem (2B-TSP). In this problem, which arises from a similar one introduced by Butler et al., a certain number of customers must be ...
Francesco Mason, Tatiana Bassetto
core
Multi-machine energy-aware scheduling
EURO Journal on Computational Optimization, 2017 The traditional set of manufacturing scheduling problems concern general and easy-to-measure economic objectives such as makespan and tardiness. The variable nature of energy costs over the course of the day remains mostly ignored by most previous ...
David Van Den Dooren +4 more
doaj
Portfolio Optimization under Small Transaction Costs: a Convex Duality Approach [PDF]
, 2013 We consider an investor with constant absolute risk aversion who trades a risky asset with general Ito dynamics, in the presence of small proportional transaction costs.
Kallsen, Jan, Li, Shen
core