The following pages link to Cid Carvalho De Souza (Q1309807):
Displaying 50 items.
- (Q210501) (redirect page) (← links)
- (Q233445) (redirect page) (← links)
- (Q324808) (redirect page) (← links)
- Partitions of rectilinear polygons with minimum stabbing number (Q324809) (← links)
- Lower bounds for large traveling umpire instances: new valid inequalities and a branch-and-cut algorithm (Q342392) (← links)
- On the complexity of the traveling umpire problem (Q476848) (← links)
- A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps (Q502465) (← links)
- The ring-star problem: a new integer programming formulation and a branch-and-cut algorithm (Q643033) (← links)
- (Q716335) (redirect page) (← links)
- An exact approach to the problem of extracting an embedded network matrix (Q716336) (← links)
- Solving the minimum convex partition of point sets with integer programming (Q824341) (← links)
- A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030) (← links)
- The node capacitated graph partitioning problem: A computational study (Q1290618) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- (Q1569938) (redirect page) (← links)
- The edge-weighted clique problem: Valid inequalities, facets and polyhedral computations (Q1569939) (← links)
- Scheduling under labour resource constraints (Q1591656) (← links)
- Minimum stabbing rectangular partitions of rectilinear polygons (Q1652208) (← links)
- Finding exact solutions for the geometric firefighter problem in practice (Q1652708) (← links)
- Arc-based integer programming formulations for three variants of proportional symbol maps (Q1751132) (← links)
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- Solving the geometric firefighter routing problem via integer programming (Q1755409) (← links)
- The maximum common edge subgraph problem: A polyhedral investigation (Q1759826) (← links)
- A branch-and-cut-and-price approach for the capacitated \(m\)-ring-star problem (Q1759849) (← links)
- Polyhedral study of the maximum common induced subgraph problem (Q1761750) (← links)
- Formulations and valid inequalities of the node capacitated graph partitioning problem (Q1814793) (← links)
- Some new classes of facets for the equicut polytope (Q1900144) (← links)
- A new approach to minimising the frontwidth in finite element calculations (Q1912069) (← links)
- A GRASP for the convex recoloring problem in graphs (Q2132370) (← links)
- Optimal area polygonization problems: exact solutions through geometric duality (Q2147134) (← links)
- Solving dynamic labeling problems to optimality using solution space reductions (Q2272380) (← links)
- A branch-and-price approach for the partition coloring problem (Q2275580) (← links)
- Minimum convex partition of point sets (Q2294038) (← links)
- Solving the natural wireless localization problem to optimality efficiently (Q2341690) (← links)
- The eternal dominating set problem for proper interval graphs (Q2345856) (← links)
- Improved bounds for the traveling umpire problem: a stronger formulation and a relax-and-fix heuristic (Q2356272) (← links)
- A relax-and-cut algorithm for the set partitioning problem (Q2462542) (← links)
- The vertex separator problem: algorithms and computations (Q2487851) (← links)
- The vertex separator problem: a polyhedral investigation (Q2487852) (← links)
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- Vehicle and crew scheduling for urban bus lines (Q2575569) (← links)
- (Q2776558) (← links)
- A branch&cut algorithm for the maximum common edge subgraph problem (Q2840513) (← links)
- Upper and lower bounding procedures for the minimum caterpillar spanning problem (Q2840519) (← links)
- A Branch-and-Cut-and-Price Approach for the Capacitated m-Ring-Star Problem (Q2840522) (← links)
- New branch-and-bound algorithms for k-cardinality tree problems (Q2840678) (← links)
- A New Lagrangian Based Branch and Bound Algorithm for the 0-1 Knapsack Problem (Q2883626) (← links)
- Optimizing the Layout of Proportional Symbol Maps: Polyhedra and Computation (Q2962548) (← links)
- Fast Optimal Labelings for Rotating Maps (Q2980907) (← links)
- Experimental Evaluation of Algorithms for the Orthogonal Milling Problem with Turn Costs (Q3005851) (← links)
