The following pages link to Francesco Maffioli (Q496638):
Displaying 50 items.
- On minimum reload cost cycle cover (Q496639) (← links)
- (Q754223) (redirect page) (← links)
- Heuristically guided algorithm for k-parity matroid problems (Q754224) (← links)
- A branch-and-cut method for the obnoxious \(p\)-median problem (Q926563) (← links)
- Minimum cut bases in undirected networks (Q968141) (← links)
- Edge-swapping algorithms for the minimum fundamental cycle basis problem (Q1014301) (← links)
- Randomized algorithms in combinatorial optimization: A survey (Q1077329) (← links)
- Most and least uniform spanning trees (Q1087546) (← links)
- Ranking arborescences in O(Km log n) time (Q1142709) (← links)
- Complexity of spanning tree problems: Part I (Q1145635) (← links)
- On the complexity of finding multi-constrained spanning trees (Q1171508) (← links)
- The image of weighted combinatorial problems (Q1179736) (← links)
- Random pseudo-polynomial algorithms for some combinatorial programming problems (Q1194734) (← links)
- Bounds for 3-matroid intersection problems (Q1218336) (← links)
- A Lagrangian heuristic for the Prize Collecting Travelling Salesman Problem (Q1265891) (← links)
- On the computation of pfaffians (Q1329786) (← links)
- A short note on the approximability of the maximum leaves spanning tree problem (Q1336751) (← links)
- A mixed-integer model for solving ordering problems with side constraints (Q1357786) (← links)
- A bound for the symmetric travelling salesman problem through matroid formulation (Q1388823) (← links)
- On the approximability of some Maximum Spanning Tree Problems (Q1391300) (← links)
- New bounds for optimum traffic assignment in satellite communication. (Q1406681) (← links)
- Discrete facility location and routing of obnoxious activities. (Q1417557) (← links)
- On the complexity of graph tree partition problems. (Q1421460) (← links)
- Cardinality constrained minimum cut problems: complexity and algorithms. (Q1427809) (← links)
- Randomized algorithms over finite fields for the exact parity base problem. (Q1578505) (← links)
- Combining linear and nonlinear objectives in spanning tree problems (Q1583705) (← links)
- Approximability of hard combinatorial optimization problems: an introduction (Q1593534) (← links)
- In memoriam Paolo M. Camerini (Q1803668) (← links)
- Note on combinatorial optimization with max-linear objective functions (Q1803670) (← links)
- Solution of the cumulative assignment problem with a well-structured tabu search method (Q1806772) (← links)
- The base-matroid and inverse combinatorial optimization problems. (Q1811117) (← links)
- Multi-constrained matroidal knapsack problems (Q1824560) (← links)
- On some multicriteria arborescence problems: Complexity and algorithms (Q1917271) (← links)
- Exact solution of the SONET ring loading problem (Q1962832) (← links)
- Solving the feedback vertex set problem on undirected graphs (Q1975362) (← links)
- Least and most colored bases (Q2381817) (← links)
- Approximation algorithms for maximum cut with limited unbalance (Q2456360) (← links)
- An annotated bibliography of combinatorial optimization problems with fixed cardinality constraints (Q2492210) (← links)
- On some properties of base-matroids (Q2492217) (← links)
- (Q2771641) (← links)
- On Minimum Reload Cost Cycle Cover (Q2883554) (← links)
- On Minimum Changeover Cost Arborescences (Q3005849) (← links)
- On minimum reload cost paths, tours, and flows (Q3008920) (← links)
- Computational experience with a SDP-based algorithm for maximum cut with limited unbalance (Q3057151) (← links)
- Unlabelled Partition Systems: Optimization and Complexity (Q3344219) (← links)
- Solving minimum K-cardinality cut problems in planar graphs (Q3418207) (← links)
- Algorithms for finding minimum fundamental cycle bases in graphs (Q3439123) (← links)
- Approximating Max Cut with Limited Unbalance (Q3439482) (← links)
- A branch‐and‐price approach to <i>k</i>‐clustering minimum biclique completion problem (Q4921257) (← links)
- On Prize‐collecting Tours and the Asymmetric Travelling Salesman Problem (Q5688010) (← links)
