The following pages link to Yuri Frota (Q496692):
Displaying 20 items.
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- (Q643032) (redirect page) (← links)
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
- Cliques, holes and the vertex coloring polytope (Q1029072) (← links)
- Evaluating balancing on social networks through the efficient solution of correlation clustering problems (Q1688940) (← links)
- Integer programming formulations and efficient local search for relaxed correlation clustering (Q2052402) (← links)
- On the exact solution of vehicle routing problems with backhauls (Q2189917) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
- The maximum balanced subgraph of a signed graph: applications and solution approaches (Q2356257) (← links)
- A branch-and-cut algorithm for the maximum \(k\)-balanced subgraph of a signed graph (Q2414463) (← links)
- Exact solutions for the two-machine robust flow shop with budgeted uncertainty (Q2670559) (← links)
- Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
- A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives (Q2840561) (← links)
- New branch-and-bound algorithms for k-cardinality tree problems (Q2840678) (← links)
- A branch-and-cut algorithm for partition coloring (Q3057147) (← links)
- A matheuristic approach for the maximum balanced subgraph of a signed graph (Q5034728) (← links)
- UAVs routes optimization on smart cities and regions (Q5074339) (← links)
- A distributed transportation simplex applied to a Content Distribution Network problem (Q5418013) (← links)
- Integer programming approaches for minimum stabbing problems (Q5418014) (← links)
- Robust permutation flow shop total weighted completion time problem: solution and application to the oil and gas industry (Q6109315) (← links)
