The following pages link to Daniel Cosmin Porumbel (Q646654):
Displaying 20 items.
- (Q245479) (redirect page) (← links)
- Using dual feasible functions to construct fast lower bounds for routing and location problems (Q499343) (← links)
- An efficient algorithm for computing the distance between close partitions (Q617900) (← links)
- A simple and effective algorithm for the MaxMin diversity problem (Q646655) (← links)
- Isomorphism testing via polynomial-time graph extensions (Q662128) (← links)
- An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring (Q976050) (← links)
- A search space ``cartography'' for guiding graph coloring heuristics (Q1040976) (← links)
- The capacitated vehicle routing problem with evidential demands (Q1642773) (← links)
- The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach (Q1649605) (← links)
- From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints (Q1662655) (← links)
- Iterated local search and column generation to solve arc-routing as a permutation set-covering problem (Q1752200) (← links)
- Heuristic algorithms and learning techniques: applications to the graph coloring problem (Q1935547) (← links)
- A recourse approach for the capacitated vehicle routing problem with evidential demands (Q2401868) (← links)
- INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING (Q2853412) (← links)
- Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems (Q5058013) (← links)
- Projective Cutting-Planes (Q5221062) (← links)
- Prize‐collecting set multicovering with submodular pricing (Q5374518) (← links)
- Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems (Q5739138) (← links)
- Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation (Q5962716) (← links)
- Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems (Q6087523) (← links)
