Entity usage

Showing below up to 50 results in range #1 to #50.

1. Optimal deep neural networks by maximization of the approximation power: Label: en
2. Joint chance-constrained multi-objective multi-commodity minimum cost network flow problem with copula theory: Label: en
3. Berth and quay crane allocation and scheduling problem with renewable energy uncertainty: a robust exact decomposition: Label: en
4. Robustness evaluation of trust and reputation systems using a deep reinforcement learning approach: Label: en
5. A branch-and-bound algorithm for the precedence-constrained minimum-cost arborescence problem: Label: en
6. A genetic algorithm for scheduling open shops with conflict graphs to minimize the makespan: Label: en
7. Integrating prepayment installment, pricing and replenishment decisions for growing items with power demand pattern and non-linear holding cost under carbon regulations: Label: en
8. A lexicographic optimization approach for a bi-objective parallel-machine scheduling problem minimizing total quality loss and total tardiness: Label: en
9. Designing a portfolio-based closed-loop supply chain network for dairy products with a financial approach: accelerated benders decomposition algorithm: Label: en
10. A double-oracle, logic-based Benders decomposition approach to solve the \(K\)-adaptability problem: Label: en
11. The balanced \(p\)-median problem with unitary demand: Label: en
12. A new formulation and branch-and-cut method for single-allocation hub location problems: Label: en
13. Efficient linear reformulations for binary polynomial optimization problems: Label: en
14. Metamodel-based simulation optimization considering a single stochastic constraint: Label: en
15. Integer programming model and branch-and-cut algorithm for the stack inbound and pre-marshalling problem: Label: en
16. An infeasible interior-point technique to generate the nondominated set for multiobjective optimization problems: Label: en
17. Optimal reservation control strategies in shared parking systems considering two types of customers: Label: en
18. The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem: Label: en
19. Population-based iterated greedy algorithm for the S-labeling problem: Label: en
20. Hybrid genetic search for the traveling salesman problem with hybrid electric vehicle and time windows: Label: en
21. A MIP model and a hybrid genetic algorithm for flexible job-shop scheduling problem with job-splitting: Label: en
22. Variable neighborhood search: the power of change and simplicity: Label: en
23. An adaptive large neighborhood search method for rebalancing free-floating electric vehicle sharing systems: Label: en
24. Estimating energy consumption and charging duration of electric vehicle in multigraph: Label: en
25. A numerical optimization approach for pricing components in customer defined bundles in a B2B market: Label: en
26. A deterministic bounding algorithm vs. a hybrid meta-heuristic to deal with a bilevel mixed-integer nonlinear optimization model for electricity dynamic pricing: Label: en
27. Risk-allocation-based index tracking: Label: en
28. The max-out min-in problem: a tool for data analysis: Label: en
29. An automatic method for generating multiple alignment alternatives for a railway bypass: Label: en
30. A matheuristic for the multi-product maritime inventory routing problem: Label: en
31. Multi-level bottleneck assignment problems: complexity and sparsity-exploiting formulations: Label: en
32. Optimising makespan and energy consumption in task scheduling for parallel systems: Label: en
33. The p-hub centre routing problem with emissions budget: formulation and solution procedure: Label: en
34. A planar facility location-allocation problem with fixed and/or variable cost structures for rural electrification: Label: en
35. An integer L-shaped algorithm for vehicle routing problem with simultaneous delivery and stochastic pickup: Label: en
36. A customized two-stage parallel computing algorithm for solving the combined modal split and traffic assignment problem: Label: en
37. A review of decentralized optimization focused on information flows of decomposition algorithms: Label: en
38. Metaheuristics with variable diversity control and neighborhood search for the heterogeneous site-dependent multi-depot multi-trip periodic vehicle routing problem: Label: en
39. On solving simplified diversified top-\(k\,s\)-plex problem: Label: en
40. Tabu search for proactive project scheduling problem with flexible resources: Label: en
41. The road train optimization problem with load assignment: Label: en
42. Effective upper and lower bounds for a two-stage reentrant flexible flow shop scheduling problem: Label: en
43. Stochastic forestry planning under market and growth uncertainty: Label: en
44. Bounds and convex heuristics for bi-objective optimal experiment design in water networks: Label: en
45. Bi-objective overlapped links vehicle routing problem for risk minimizing valuables transportation: Label: en
46. Service expansion for chained business facilities under congestion and market competition: Label: en
47. Exact and metaheuristic approaches to solve the integrated production scheduling, berth allocation and storage yard allocation problem: Label: en
48. A parallel adaptive memory algorithm for the capacitated modular hub location problem: Label: en
49. New resource-constrained project scheduling instances for testing (meta-)heuristic scheduling algorithms: Label: en
50. Approximate Condorcet partitioning: solving large-scale rank aggregation problems: Label: en