The following pages link to Petrică C. Pop (Q455035):
Displaying 50 items.
- Clique-based facets for the precedence constrained knapsack problem (Q431007) (← links)
- The integer approximation error in mixed-integer optimal control (Q431013) (← links)
- Generalized network design problems. Modeling and optimization. (Q455036) (← links)
- (Q592083) (redirect page) (← links)
- A smoothing method for zero--one constrained extremum problems (Q637567) (← links)
- On a bottleneck routing problem (Q643816) (← links)
- LP-based approximation algorithms for capacitated facility location (Q662296) (← links)
- (Q702363) (redirect page) (← links)
- New models of the generalized minimum spanning tree problem (Q702364) (← links)
- An improved hybrid ant-local search algorithm for the partition graph coloring problem (Q747914) (← links)
- Flow shop scheduling problems with decreasing linear deterioration under dominant machines (Q868141) (← links)
- Time-varying network optimization. (Q885899) (← links)
- Linear programming and generalizations. A problem-based introduction with spreadsheets (Q986625) (← links)
- Improved full-Newton step \(O(nL)\) infeasible interior-point method for linear optimization (Q987511) (← links)
- Nonlinear discrete optimization. An algorithmic theory (Q993280) (← links)
- Packing circuits in matroids (Q1013971) (← links)
- A flexible approach to ranking with an application to MBA programs (Q1037674) (← links)
- A two-level solution approach for solving the generalized minimum spanning tree problem (Q1681269) (← links)
- A memetic algorithm approach for solving the multidimensional multi-way number partitioning problem (Q1792021) (← links)
- A combined DCA: GA for constructing highly nonlinear balanced Boolean functions in cryptography (Q1959232) (← links)
- A novel matheuristic approach for a two-stage transportation problem with fixed costs associated to the routes (Q2185523) (← links)
- The generalized minimum spanning tree problem: an overview of formulations, solution procedures and latest advances (Q2286911) (← links)
- New mathematical models of the generalized vehicle routing problem and extensions (Q2428862) (← links)
- On the complexity of the selective graph coloring problem in some special classes of graphs (Q2453167) (← links)
- On the prize-collecting generalized minimum spanning tree problem (Q2480209) (← links)
- Perspective reformulations of mixed integer nonlinear programs with indicator variables (Q2638370) (← links)
- An Ant Algorithm for the Partition Graph Coloring Problem (Q2814544) (← links)
- Reducing the bandwidth of a sparse matrix with a genetic algorithm (Q2926497) (← links)
- Selective Graph Coloring in Some Special Classes of Graphs (Q3167636) (← links)
- A novel genetic algorithm for solving the clustered shortest-path tree problem (Q3384537) (← links)
- (Q3392397) (← links)
- (Q3446182) (← links)
- (Q3605356) (← links)
- Exact Algorithms for Generalized Combinatorial Optimization Problems (Q3611967) (← links)
- (Q3638643) (← links)
- (Q3639558) (← links)
- (Q4448919) (← links)
- (Q4515682) (← links)
- (Q4569384) (← links)
- (Q4569439) (← links)
- (Q4649350) (← links)
- Solving a Two-stage Supply Chain Network Design Problem with Fixed Costs by a Hybrid Genetic Algorithm (Q5099796) (← links)
- (Q5116037) (← links)
- (Q5116097) (← links)
- (Q5116116) (← links)
- (Q5308951) (← links)
- (Q5309465) (← links)
- (Q5314095) (← links)
- A decomposition-based method for solving the clustered vehicle routing problem (Q5384360) (← links)
- (Q5392237) (← links)