The following pages link to Celso Carneiro Ribeiro (Q1309808):
Displaying 50 items.
- (Q167622) (redirect page) (← links)
- (Q312487) (redirect page) (← links)
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
- Edge coloring: a natural model for sports scheduling (Q323273) (← links)
- Heuristics for the generalized median graph problem (Q323345) (← links)
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering (Q336718) (← links)
- Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
- (Q496693) (redirect page) (← links)
- A branch-and-cut algorithm for the equitable coloring problem using a formulation by representatives (Q496694) (← links)
- Adaptive memory in multistart heuristics for multicommodity network design (Q535395) (← links)
- Experiments with LAGRASP heuristic for set \(k\)-covering (Q691433) (← links)
- Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
- Exploiting run time distributions to compare sequential and parallel stochastic local search algorithms (Q693145) (← links)
- Scheduling in sports: an annotated bibliography (Q733513) (← links)
- A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
- (Q800228) (redirect page) (← links)
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problems (Q800229) (← links)
- Routing and wavelength assignment by partition colouring (Q819072) (← links)
- Heuristics for the mirrored traveling tournament problem (Q863992) (← links)
- A tabu search approach for solving a difficult forest harvesting machine location problem (Q863994) (← links)
- A tight worst case bound for the performance ratio of heuristics for the minimum rectilinear Steiner tree problem (Q920030) (← links)
- An efficient implementation of a VNS/ILS heuristic for a real-life car sequencing problem (Q932175) (← links)
- A hybrid heuristic for a multi-objective real-life car sequencing problem with painting and assembly line constraints (Q932216) (← links)
- Performance evaluation of vector implementations of combinatorial algorithms (Q1062729) (← links)
- A heuristic approach to hard constrained shortest path problems (Q1063522) (← links)
- Hyperbolic 0-1 programming and query optimization in information retrieval (Q1181735) (← links)
- Location and sizing of offshore platforms for oil exploration (Q1194731) (← links)
- Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study (Q1309809) (← links)
- Penalty computations for the set partitioning problem (Q1309877) (← links)
- A graph theory approach to subcontracting, machine duplication and intercell moves in cellular manufacturing (Q1327210) (← links)
- Modelling location and sizing of offshore platforms (Q1328585) (← links)
- A graph partitioning heuristic for the parallel pseudo-exhaustive logical test of VLSI combinational circuits (Q1339115) (← links)
- A constraint generation scheme to probabilistic linear problems with an application to power system expansion planning (Q1339139) (← links)
- Variable neighborhood search for the degree-constrained minimum spanning tree problem (Q1348252) (← links)
- Boolean query optimization and the 0-1 hyperbolic sum problem (Q1356211) (← links)
- Performance evaluation of a parallel tabu search task scheduling algorithm (Q1606891) (← links)
- A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
- Tumor growth modelling by cellular automata (Q1691274) (← links)
- An ILS heuristic for the traveling tournament problem with predefined venues (Q1761896) (← links)
- An optimal column-generation-with-ranking algorithm for very large scale set partitioning problems in traffic assignment (Q1823142) (← links)
- Probability distribution of solution time in GRASP: an experimental investigation (Q1850990) (← links)
- Heuristics for the phylogeny problem (Q1850993) (← links)
- Parallel tabu search message-passing synchronous strategies for task scheduling under precendence constraints (Q1922637) (← links)
- \texttt{tttplots-compare}: a Perl program to compare time-to-target plots or general runtime distributions of randomized algorithms (Q2018872) (← links)
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem (Q2028800) (← links)
- Multi-start methods for combinatorial optimization (Q2253534) (← links)
- The traveling tournament problem with predefined venues (Q2268523) (← links)
- A hybrid heuristic for the diameter constrained minimum spanning tree problem (Q2268933) (← links)
- TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
- Scheduling workover rigs for onshore oil production (Q2489895) (← links)
