The following pages link to Celso Carneiro Ribeiro (Q1309808):
Displaying 50 items.
- Multiprocessor scheduling under precedence constraints: polyhedral results (Q2489902) (← links)
- Maximizing breaks and bounding solutions to the mirrored traveling tournament problem (Q2500541) (← links)
- Query optimization in distributed relational databases (Q2567838) (← links)
- New formulations and branch-and-cut procedures for the longest induced path problem (Q2669795) (← links)
- Local search with perturbations for the prize-collecting Steiner tree problem in graphs (Q2747806) (← links)
- (Q2776545) (← links)
- (Q2776558) (← links)
- (Q2776561) (← links)
- A biased random-key genetic algorithm for single-round divisible load scheduling (Q2806431) (← links)
- Exact formulations for the minimum interference problem in<i>k</i>-connected<i>ad hoc</i>wireless networks (Q2829159) (← links)
- A Branch-and-Cut Algorithm for Equitable Coloring based on a Formulation by Representatives (Q2840561) (← links)
- A Hybrid GRASP with Perturbations for the Steiner Problem in Graphs (Q2884534) (← links)
- Solving diameter-constrained minimum spanning tree problems by constraint programming (Q3002550) (← links)
- A GRASP/VND heuristic for the phylogeny problem using a new neighborhood structure (Q3025048) (← links)
- A branch-and-cut algorithm for partition coloring (Q3057147) (← links)
- Optimization by GRASP (Q3186644) (← links)
- (Q3368667) (← links)
- An application of integer programming to playoff elimination in football championships (Q3410163) (← links)
- Parallel Greedy Randomized Adaptive Search Procedures (Q3424837) (← links)
- A multistart constructive heuristic for sequencing by hybridization using adaptive memory (Q3439660) (← links)
- (Q3500162) (← links)
- Constraint Programming for the Diameter Constrained Minimum Spanning Tree Problem (Q3503535) (← links)
- (Q3730365) (← links)
- (Q3777451) (← links)
- A linear time algorithm for the computation of some distance functions between convex polygons (Q3991698) (← links)
- (Q4224929) (← links)
- A Column Generation Approach to the Multiple-Depot Vehicle Scheduling Problem (Q4287598) (← links)
- Optimal matching of convex polygons (Q4310410) (← links)
- A GRASP for graph planarization (Q4347284) (← links)
- Randomized heuristics for the Max-Cut problem (Q4405937) (← links)
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment (Q4427329) (← links)
- (Q4452897) (← links)
- A new formulation for scheduling unrelated processor under precedence constraints (Q4511608) (← links)
- Algorithm 797 (Q4518214) (← links)
- (Q4519136) (← links)
- (Q4537105) (← links)
- A multi‐agent framework to build integer programming applications to playoff elimination in sports tournaments (Q4600631) (← links)
- A GRASP heuristic using path‐relinking and restarts for the Steiner traveling salesman problem (Q4601628) (← links)
- Extending time‐to‐target plots to multiple instances (Q4624885) (← links)
- A GRASP with path-relinking for private virtual circuit routing (Q4804169) (← links)
- (Q4813179) (← links)
- A multi-criteria tabu search approach to cell formation problems in group technology with multiple objectives (Q4846489) (← links)
- A distributed and hierarchical strategy for autonomic grid-enabled cooperative metaheuristics with applications (Q4918246) (← links)
- Sports scheduling: Problems and applications (Q4918255) (← links)
- Probabilistic stopping rules for GRASP heuristics and extensions (Q4924054) (← links)
- A BRKGA-based matheuristic for the maximum quasi-clique problem with an exact local search strategy (Q5002257) (← links)
- Exact and approximate algorithms for the longest induced path problem (Q5003500) (← links)
- A heuristic for the minimum cost chromatic partition problem (Q5109809) (← links)
- Applying software engineering techniques in the development and management of linear and integer programming applications (Q5246813) (← links)
- (Q5294044) (← links)
