Výsledky vyhľadávania - "Furini, Fabio"

Preface: decomposition methods for hard optimization problems.

Autori: Furini, Fabio Ljubić, Ivana Traversi, Emiliano

Zdroj: Annals of Operations Research; Jan2020, Vol. 284 Issue 2, p483-485, 3p

Predmety: DECOMPOSITION method, MATHEMATICAL optimization, COMBINATORIAL optimization, PRODUCTION scheduling, TELECOMMUNICATION

Casting Light on the Hidden Bilevel Combinatorial Structure of the Capacitated Vertex Separator Problem

Autori: Furini Fabio Ljubić Ivana Malaguti Enrico a ďalší

Zdroj: Operations Research. 70:2399-2420

Predmety: bilevel optimization, Stackelberg games, graph decomposition, branch-and-cut, Benders decomposition, 0211 other engineering and technologies, 02 engineering and technology

Popis súboru: application/pdf

Prístupová URL adresa: https://pubsonline.informs.org/doi/10.1287/opre.2021.2110

A branch-and-price algorithm for the Minimum Sum Coloring Problem ; Un algorithme de branchement et de prix pour le problème de coloration de la somme minimale

Autori: Delle Donne, Diego Furini, Fabio Malaguti, Enrico a ďalší

Prispievatelia: Delle Donne, Diego Furini, Fabio Malaguti, Enrico a ďalší

Zdroj: ISSN: 0166-218X ; Discrete Applied Mathematics ; https://hal.science/hal-04431455 ; Discrete Applied Mathematics, 2021, 303, pp.39-56. ⟨10.1016/j.dam.2020.08.031⟩.

Predmety: Minimum Sum Coloring, Vertex Coloring, Integer Linear Programming, Column Generation, Branch-and-Price Algorithm, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], [MATH.MATH-OC]Mathematics [math]/Optimization and Control [math.OC]

Dostupnosť: https://hal.science/hal-04431455
https://hal.science/hal-04431455v1/document
https://hal.science/hal-04431455v1/file/DAM_REV.pdf
https://doi.org/10.1016/j.dam.2020.08.031

A Numerically Exact Algorithm for the Bin-Packing Problem.

Autori: Baldacci, Roberto Coniglio, Stefano Cordeau, Jean-François a ďalší

Zdroj: INFORMS Journal on Computing; Jan/Feb2024, Vol. 36 Issue 1, p141-162, 22p

Predmety: ALGORITHMS, PROBLEM solving

Variable and constraint reduction techniques for the temporal bin packing problem with fire-ups.

Autori: Martinovic, John Strasdat, Nico Valério de Carvalho, José a ďalší

Zdroj: Optimization Letters; Nov2022, Vol. 16 Issue 8, p2333-2358, 26p

Submodular maximization of concave utility functions composed with a set-union operator with applications to maximal covering location problems.

Autori: Coniglio, Stefano Furini, Fabio Ljubić, Ivana

Zdroj: Mathematical Programming; Nov2022, Vol. 196 Issue 1/2, p9-56, 48p

Predmety: CONCAVE functions, SUBMODULAR functions, MATHEMATICAL programming, UTILITY functions, DIFFERENTIABLE functions, OPERATOR functions, GREEDY algorithms

On the exact separation of cover inequalities of maximum-depth.

Autori: Catanzaro, Daniele Coniglio, Stefano Furini, Fabio

Zdroj: Optimization Letters; Mar2022, Vol. 16 Issue 2, p449-469, 21p

A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques.

Autori: Gschwind, Timo Irnich, Stefan Furini, Fabio a ďalší

Zdroj: INFORMS Journal on Computing; Summer2021, Vol. 33 Issue 3, p1070-1090, 21p

Predmety: SOCIAL networks, SOCIAL network analysis, GRAPH connectivity, GRAPH algorithms, ALGORITHMS

Author index.

Zdroj: 2014 International Conference on Control, Decision & Information Technologies (CoDIT); 2014, p1-8, 8p

On integer and bilevel formulations for the k-vertex cut problem.

Autori: Furini, Fabio Ljubić, Ivana Malaguti, Enrico a ďalší

Zdroj: Mathematical Programming Computation; Jun2020, Vol. 12 Issue 2, p133-164, 32p

Theoretical and computational study of several linearisation techniques for binary quadratic problems.

Autori: Furini, Fabio Traversi, Emiliano

Zdroj: Annals of Operations Research; Aug2019, Vol. 279 Issue 1/2, p387-411, 25p

Predmety: LINEAR programming, COMBINATORIAL optimization, KNAPSACK problems, CUTTING stock problem, BACKPACKS

QPLIB: a library of quadratic programming instances.

Autori: Furini, Fabio Traversi, Emiliano Belotti, Pietro a ďalší

Zdroj: Mathematical Programming Computation; Jun2019, Vol. 11 Issue 2, p237-265, 29p

On the Product Knapsack Problem.

Autori: D’Ambrosio, Claudia Furini, Fabio Monaci, Michele a ďalší

Zdroj: Optimization Letters; Jun2018, Vol. 12 Issue 4, p691-712, 22p

Approximated perspective relaxations: a project and lift approach.

Autori: Frangioni, Antonio Furini, Fabio Gentile, Claudio

Zdroj: Computational Optimization & Applications; Apr2016, Vol. 63 Issue 3, p705-735, 31p

Predmety: MATHEMATICAL reformulation, NONLINEAR programming, INTEGER programming, MATHEMATICAL variables, GRAPHICAL projection

An Improved DSATUR-Based Branch-and-Bound Algorithm for the Vertex Coloring Problem.

Autori: Furini, Fabio Gabrel, Virginie Ternier, Ian‐Christopher

Zdroj: Networks; Jan2017, Vol. 69 Issue 1, p124-141, 33p

Predmety: UNDIRECTED graphs, GRAPH coloring, MATHEMATICAL bounds

ILP and CP Formulations for the Lazy Bureaucrat Problem.

Autori: Furini, Fabio Ljubić, Ivana Sinnl, Markus

Zdroj: Integration of AI & OR Techniques in Constraint Programming 12th International Conference, CPAIOR 2015, Barcelona, Spain, May 18-22, 2015, Proceedings; 2015, p255-270, 16p

State Space Reduced Dynamic Programming for the Aircraft Sequencing Problem with Constrained Position Shifting.

Autori: Furini, Fabio Kidd, Martin Philip Persiani, Carlo Alfredo a ďalší

Zdroj: Combinatorial Optimization: Third International Symposium, ISCO 2014, Lisbon, Portugal, March 5-7, 2014, Revised Selected Papers; 2014, p267-279, 13p

Improved rolling horizon approaches to the aircraft sequencing problem.

Autori: Furini, Fabio Kidd, Martin Persiani, Carlo a ďalší

Zdroj: Journal of Scheduling; Oct2015, Vol. 18 Issue 5, p435-447, 13p

Predmety: AIRPLANE maintenance, AIR traffic control, RUNWAY capacity, LINEAR programming, PRODUCTION scheduling, MATHEMATICAL models

Uncommon Dantzig-Wolfe Reformulation for the Temporal Knapsack Problem.

Autori: Caprara, Alberto Furini, Fabio Malaguti, Enrico

Zdroj: INFORMS Journal on Computing; Summer2013, Vol. 25 Issue 3, p560-571, 12p, 8 Charts, 1 Graph

Predmety: MATHEMATICAL reformulation, KNAPSACK problems, GENERALIZATION, PROBLEM solving, LINEAR programming, CONSTRAINT satisfaction, INTEGERS

A new branch-and-bound algorithm for the maximum edge-weighted clique problem

Autori: Stefano Coniglio Fabio Furini Pablo San Segundo a ďalší

Prispievatelia: Stefano Coniglio Fabio Furini Pablo San Segundo a ďalší

Zdroj: Digital.CSIC. Repositorio Institucional del CSIC
instname
European journal of operational research 278 (2019): 76–90. doi:10.1016/j.ejor.2019.03.047
info:cnr-pdr/source/autori:San Segundo, Pablo; Coniglio, Stefano; Furini, Fabio; Ljubic, Ivana/titolo:A new branch-and-bound algorithm for the maximum edge-weighted clique problem/doi:10.1016%2Fj.ejor.2019.03.047/rivista:European journal of operational research/anno:2019/pagina_da:76/pagina_a:90/intervallo_pagine:76–90/volume:278

Predmety: Combinatorial optimization, Branch-and-bound, 0211 other engineering and technologies, 0202 electrical engineering, electronic engineering, information engineering, 02 engineering and technology, Maximum edge-weighted clique problem, Recherche opérationnelle

Popis súboru: application/pdf; text

Prístupová URL adresa: https://eprints.soton.ac.uk/430023/1/mewc_BB_rev.pdf
http://hdl.handle.net/10261/216705
https://ideas.repec.org/a/eee/ejores/v278y2019i1p76-90.html
https://digital.csic.es/handle/10261/216705
https://doi.org/10.1016/j.ejor.2019.03.047
https://dblp.uni-trier.de/db/journals/eor/eor278.html#SegundoCFL19
https://www.sciencedirect.com/science/article/pii/S0377221719303054
https://eprints.soton.ac.uk/430023/