Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 20 of 155 for “"Combinatorial optimization problem"”.

  1. Applying record value theory in combinatorial optimization with application to environmental statistics

    We consider the problem of optimal subset selection from a set of correlated random variables. In particular, we consider the associated combinatorial optimization problem of maximizing the determinant of a symmetric positive semidefinite matrix that characterizes the chosen subset. This problem …

    ubc Repository record for Applying record value theory in combinatorial optimization with application to environmental statistics (opens in a new tab) Download PDF for Applying record value theory in combinatorial optimization with application to environmental statistics (opens in a new tab)

  2. Parametric approaches to fractional programs: Analytical and empirical study

    Fractional programming is used to model problems where the objective function is a ratio of functions. A parametric modeling approach provides effective technique for obtaining optimal solutions of these fractional programming problems. Although many heuristic algorithms have been proposed and …

    purdue-thes Repository record for Parametric approaches to fractional programs: Analytical and empirical study (opens in a new tab)

  3. Delivery service assortment and product pricing in online retailing : the impact of pricing flexibility and customer rating

    … delivery service assortment and product pricing problem in the context of online retailing where the seller selects a series of delivery options from a set of available alternatives for the customers to choose from and decides the price for the product and the listed surcharge for each delivery …

    ubc Repository record for Delivery service assortment and product pricing in online retailing : the impact of pricing flexibility and customer rating (opens in a new tab) Download PDF for Delivery service assortment and product pricing in online retailing : the impact of pricing flexibility and customer rating (opens in a new tab)

  4. Um algoritmo híbrido para o problema de roteamento de veículos com frotas heterogêneas

    … for the Heterogeneous Fleet Vehicle Routing Problem (HVRP), which is a combinatorial optimization problem NP-hard, and is characterized by the use of a limited fleet consists of different vehicles with different capacities. The hybrid method developed makes use of a memetic algorithm …

    brazil-ufrn Repository record for Um algoritmo híbrido para o problema de roteamento de veículos com frotas heterogêneas (opens in a new tab)

  5. Deterministic Annealing for Correspondence, Pose, and Recognition

    The problem of determining the pose - the position and orientation - of an object given a model and an image of that object is a fundamental problem in computer vision. Applications include object recognition, object tracking, site inspection and updating, and autonomous navigation when scene …

    maryland Repository record for Deterministic Annealing for Correspondence, Pose, and Recognition (opens in a new tab)

  6. Exploring various set covering problem techniques to tackle the optimal camera placement problem

    Optimal Camera Placement (OCP) problem is a combinatorial optimization problem, where the aim is to find an optimal placement of cameras, given that a target area is completely covered. A single-objective OCP is commonly formulated in two possible ways. The first one is to maximize the area …

    lancaster Download PDF for Exploring various set covering problem techniques to tackle the optimal camera placement problem (opens in a new tab)

  7. Particle swarm optimization for two-connected networks with bounded rings

    … Two-Connected Network with Bounded Ring (2CNBR) problem is a network design problem addressing the connection of servers to create a survivable network with limited redirections in the event of failures. Particle Swarm Optimization (PSO) is a stochastic population-based optimization technique …

    brock Repository record for Particle swarm optimization for two-connected networks with bounded rings (opens in a new tab)

  8. Heuristics for solving problem of evacuating non-ambulatory people in a short-notice disaster

    … (HADR) operations gain importance, a number of problems become evident. The time-sensitive problem of evacuating non-ambulatory people from a disaster area proves to be a challenging combinatorial optimization problem. The scope of the problem is defined by drawing analogies to similar vehicle …

    nps Repository record for Heuristics for solving problem of evacuating non-ambulatory people in a short-notice disaster (opens in a new tab)

  9. Algorithms for Scheduling Teaching Assistants - A comparison focused on preference satisfaction, workload fairness, and computational performance

    … scheduling of Teaching Assistants is a complex combinatorial optimization problem faced by many universities, involving constraints such as course requirements, availability, working hours, and fairness. A survey was conducted among Teaching Assistants at the Department of Computer Science and …

    chalmers Repository record for Algorithms for Scheduling Teaching Assistants - A comparison focused on preference satisfaction, workload fairness, and computational performance (opens in a new tab)

  10. DeepGridMCLP: A Deep Reinforcement Learning Approach to Solve the Maximal Covering Location Problem with Facilities in Continuous Regions

    The Maximal Covering Location Problem (MCLP) is a classic Combinatorial Optimization Problem (COP) in spatial optimization and operations research, predominatnly used for strategic public facility placement. The model’s objective is to determine the optimal locations for a fixed number of …

    claremont Repository record for DeepGridMCLP: A Deep Reinforcement Learning Approach to Solve the Maximal Covering Location Problem with Facilities in Continuous Regions (opens in a new tab)

  11. A Graph Convolutional Network approach for enhancing Set Covering Problem solvers

    The Set Covering Problem (SCP) is an NP-hard combinatorial optimization problem with applications in telecommunication, logistics, and transportation. Solving SCP is computationally challenging due to the combinatorial explosion of potential solutions, particularly for large instances. This study …

    utc Repository record for A Graph Convolutional Network approach for enhancing Set Covering Problem solvers (opens in a new tab)

  12. Regret Models and Preprocessing Techniques for Combinatorial Optimization under Uncertainty

    We propose some probabilistic models for combinatorial optimization with uncertainty. The first model is to minimize the worst-case condition value-at-risk (WCVaR) of cost for a linear combinatorial optimization problem. We show that under the marginal distribution and marginal moment models, the …

    nus Repository record for Regret Models and Preprocessing Techniques for Combinatorial Optimization under Uncertainty (opens in a new tab) Download file for Regret Models and Preprocessing Techniques for Combinatorial Optimization under Uncertainty (opens in a new tab)

  13. On the Complexity of the Circuit Obfuscation Problem for Split Manufacturing

    … introduced a number of interesting computational problems in the context of directed acyclic graphs (DAGs). In this thesis, we pick one of these problems, circuit obfuscation --- a combinatorial optimization problem --- and study its computational complexity. First, we prove that the problem is …

    waterloo Repository record for On the Complexity of the Circuit Obfuscation Problem for Split Manufacturing (opens in a new tab)

  14. ROBUST TIME-VARYING FORMATION CONTROL WITH ADAPTIVE SUBMODULARITY

    … locations. This effectually reduces the NP-hard combinatorial optimization problem to a polynomial time process. The greedy algorithm is used to adaptively recompute the optimal formation in simulation. This controller reduces the complexity of employing large numbers of autonomous agents in …

    nps Repository record for ROBUST TIME-VARYING FORMATION CONTROL WITH ADAPTIVE SUBMODULARITY (opens in a new tab)

  15. Combinatorial Optimization with Reinforcement Learning

    … master’s thesis delves into the topic of solving combinatorial optimization problems with methods based on reinforcement learning, and specifically, we explore the potential of iterative route decoding and gradient updates in enhancing the performance of route decoding. In this context, route …

    chalmers Repository record for Combinatorial Optimization with Reinforcement Learning (opens in a new tab)

  16. Deep Learning in State of the Art Airline Crew Rostering Algorithms

    … work among employees in Airline crew planning a problem called the crew rostering problem is formed. It is a combinatorial optimization problem and solving large problem instances commonly utilize column generation. This thesis investigates utilizing machine learning predictions instead of …

    chalmers Repository record for Deep Learning in State of the Art Airline Crew Rostering Algorithms (opens in a new tab)

  17. Collision-free path planning for robots using B-splines and simulated annealing

    … under geometric and intrinsic constraints. The problem is formulated as a combinatorial optimization problem and solved by using simulated annealing. A two-link planar manipulator is included to show that the B-spline curve can also be synthesized by adding kinematic characteristics of the …

    iastate Repository record for Collision-free path planning for robots using B-splines and simulated annealing (opens in a new tab)

  18. Multiple Description Video Communications in Wireless Ad Hoc Networks

    … In this thesis, we study three important problems regarding multiple description video communications in wireless ad hoc networks. They are multipath routing for MD video, MD video multicast, and joint routing and server selection for MD video in wireless ad hoc networks. In multipath …

    vt Repository record for Multiple Description Video Communications in Wireless Ad Hoc Networks (opens in a new tab)

  19. Parallel and Serial Algorithms for Vehicle Routing Problems

    The vehicle routing problem (VRP) is a widely studied combinatorial optimization problem that has many applications. Due to its intrinsic difficulty and the size of problems encountered in practice, most solution methods for the VRP are heuristic in nature and lead to high quality, yet probably not …

    maryland Repository record for Parallel and Serial Algorithms for Vehicle Routing Problems (opens in a new tab)

Page 1 of 8