The following pages link to (Q3056948):
Displaying 50 items.
- GIDEN (Q17309) (← links)
- Enumerating Polytropes (Q161347) (← links)
- Personnel scheduling and supplies provisioning in emergency relief operations (Q256662) (← links)
- The generalized assignment problem with minimum quantities (Q257215) (← links)
- Degree-constrained graph orientation: maximum satisfaction and minimum violation (Q260260) (← links)
- Inverse feasibility problems of the inverse maximum flow problems (Q261056) (← links)
- Fast algorithms for the undirected negative cost cycle detection problem (Q261362) (← links)
- Fair matchings and related problems (Q270032) (← links)
- Notes on the single route lateral transhipment problem (Q276506) (← links)
- Dynamic graph models and their properties (Q276764) (← links)
- The minmax regret robust shortest path problem in a finite multi-scenario model (Q279255) (← links)
- Budget-constrained minimum cost flows (Q281825) (← links)
- Deciding probabilistic automata weak bisimulation: theory and practice (Q282105) (← links)
- A simple linear algorithm for the edge-disjoint \((s, t)\)-paths problem in undirected planar graphs (Q287243) (← links)
- A two-stage stochastic transportation problem with fixed handling costs and a priori selection of the distribution channels (Q287653) (← links)
- Equilibrium in multi-criteria transportation networks (Q289073) (← links)
- Decomposition and mean-field approach to mixed integer optimal compensation problems (Q289132) (← links)
- Parameter-free sampled fictitious play for solving deterministic dynamic programming problems (Q289136) (← links)
- Complexity of one packing optimization problem (Q289799) (← links)
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm (Q294662) (← links)
- Explore stochastic instabilities of periodic points by transition path theory (Q295320) (← links)
- The shortest-path problem with resource constraints with \((k, 2)\)-loop elimination and its application to the capacitated arc-routing problem (Q296774) (← links)
- The static bicycle relocation problem with demand intervals (Q296779) (← links)
- Fast and fine quickest path algorithm (Q296816) (← links)
- An integrated approach for earthwork allocation, sequencing and routing (Q296873) (← links)
- An implicit enumeration algorithm for the passenger service planning problem: application to the Taiwan railways administration line (Q296903) (← links)
- A heuristic solution technique to attain the minimal total cost bounds of transporting a homogeneous product with varying demands and supplies (Q297085) (← links)
- Branch-and-price algorithm for the resilient multi-level hop-constrained network design (Q297189) (← links)
- Optimal relay node placement in delay constrained wireless sensor network design (Q297218) (← links)
- Clearance time estimation for incorporating evacuation risk in routing strategies for evacuation operations (Q298898) (← links)
- Trip-based path algorithms using the transit network hierarchy (Q298925) (← links)
- The complexity of finding arc-disjoint branching flows (Q298947) (← links)
- Component-cardinality-constrained critical node problem in graphs (Q299073) (← links)
- Frequency optimization in public transportation systems: formulation and metaheuristic approach (Q299827) (← links)
- Scheduling with few changes (Q299829) (← links)
- Local convex hulls for a special class of integer multicommodity flow problems (Q301702) (← links)
- Modelling practical placement of trainee teachers to schools (Q301931) (← links)
- Equivalent formulations for the branched transport and urban planning problems (Q304880) (← links)
- The label cut problem with respect to path length and label frequency (Q313969) (← links)
- On the hardness of bribery variants in voting with CP-nets (Q314427) (← links)
- Capacity inverse minimum cost flow problems under the weighted Hamming distance (Q315493) (← links)
- Strongly polynomial primal monotonic build-up simplex algorithm for maximal flow problems (Q317432) (← links)
- Interdependent network restoration: on the value of information-sharing (Q319346) (← links)
- A bi-objective column generation algorithm for the multi-commodity minimum cost flow problem (Q319360) (← links)
- Resource loading with time windows (Q319369) (← links)
- A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions (Q319409) (← links)
- Solving the traveling repairman problem on a line with general processing times and deadlines (Q319440) (← links)
- A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem (Q319447) (← links)
- Integral flow decomposition with minimum longest path length (Q320005) (← links)
- Maximizing Nash product social welfare in allocating indivisible goods (Q320030) (← links)
