Results 71 to 80 of about 790 (89)
Uncontrolled inexact information within bundle methods
EURO Journal on Computational Optimization, 2017 We consider convex non-smooth optimization problems where additional information with uncontrolled accuracy is readily available. It is often the case when the objective function is itself the output of an optimization solver, as for large-scale energy ...
Jérôme Malick +2 more
doaj
EURO Journal on Computational Optimization, 2019 In the two-dimensional guillotine cutting-stock problem, the objective is to minimize the number of large plates used to cut a list of small rectangles.
François Clautiaux +3 more
doaj
Evaluating performance of image segmentation criteria and techniques
EURO Journal on Computational Optimization, 2013 The image segmentation problem is to delineate, or segment, a salient feature in an image. As such, this is a bipartition problem with the goal of separating the foreground from the background. An NP-hard optimization problem, the Normalized Cut problem,
DoritS. Hochbaum +2 more
doaj
Core group placement: allocation and provisioning of heterogeneous resources
EURO Journal on Computational Optimization, 2019 We present a theoretical and empirical study on a recently introduced combinatorial optimization problem, namely core group placement problem. The problem arises from real-world business requirements as part of resource allocation in cloud management. In
Serdar Kadıoğlu
doaj
A computational study of exact subgraph based SDP bounds for Max-Cut, stable set and coloring. [PDF]
Math Program, 2020 Gaar E, Rendl F.
europepmc +1 more source
RIGID GRAPH COMPRESSION: MOTIF-BASED RIGIDITY ANALYSIS FOR DISORDERED FIBER NETWORKS. [PDF]
Multiscale Model Simul, 2018 Heroy S +4 more
europepmc +1 more source
New algorithms for maximum disjoint paths based on tree-likeness. [PDF]
Math Program, 2018 Fleszar K, Mnich M, Spoerhase J.
europepmc +1 more source
A linear time algorithm for linearizing quadratic and higher-order shortest path problems. [PDF]
Math ProgramÇela E +4 more
europepmc +1 more source
Generating subtour elimination constraints for the TSP from pure integer solutions. [PDF]
Cent Eur J Oper Res, 2017 Pferschy U, Staněk R.
europepmc +1 more source