Daniel Cosmin Porumbel

From MaRDI portal
Revision as of 08:39, 25 September 2023 by Import230924090903 (talk | contribs) (Created automatically from import230924090903)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:646654

Available identifiers

zbMath Open porumbel.daniel-cosminMaRDI QIDQ646654

List of research outcomes





PublicationDate of PublicationType
Using an exact bi-objective decoder in a memetic algorithm for arc-routing (and other decoder-expressible) problems2023-11-15Paper
Projective Cutting-Planes for Robust Linear Programming and Cutting Stock Problems2022-12-01Paper
Demystifying the characterization of SDP matrices in mathematical programming2022-10-24Paper
Projective Cutting-Planes2020-03-27Paper
Prize‐collecting set multicovering with submodular pricing2018-09-14Paper
From the separation to the intersection sub-problem in Benders decomposition models with prohibitively-many constraints2018-08-20Paper
The capacitated vehicle routing problem with evidential demands: a belief-constrained programming approach2018-07-06Paper
The capacitated vehicle routing problem with evidential demands2018-06-15Paper
Iterated local search and column generation to solve arc-routing as a permutation set-covering problem2018-05-24Paper
A recourse approach for the capacitated vehicle routing problem with evidential demands2017-09-05Paper
Constraint Aggregation in Column Generation Models for Resource-Constrained Covering Problems2017-06-02Paper
Ray projection for optimizing polytopes with prohibitively many constraints in set-covering column generation2016-02-23Paper
Using dual feasible functions to construct fast lower bounds for routing and location problems2015-09-30Paper
INFORMED REACTIVE TABU SEARCH FOR GRAPH COLORING2013-10-21Paper
Heuristic algorithms and learning techniques: applications to the graph coloring problem2013-02-18Paper
Isomorphism testing via polynomial-time graph extensions2012-02-21Paper
A simple and effective algorithm for the MaxMin diversity problem2011-11-17Paper
An efficient algorithm for computing the distance between close partitions2011-01-14Paper
An evolutionary approach with diversity guarantee and well-informed grouping recombination for graph coloring2010-06-11Paper
A search space ``cartography for guiding graph coloring heuristics2009-11-27Paper

Research outcomes over time

This page was built for person: Daniel Cosmin Porumbel