The following pages link to (Q3056948):
Displaying 50 items.
- The unrooted set covering connected subgraph problem differentiating between HIV envelope sequences (Q320748) (← links)
- Models and algorithms for network reduction (Q320811) (← links)
- Polynomially solvable personnel rostering problems (Q320874) (← links)
- Continuous multifacility ordered median location problems (Q322399) (← links)
- Network-flow based algorithms for scheduling production in multi-processor open-pit mines accounting for metal uncertainty (Q322445) (← links)
- The weighted uncapacitated planned maintenance problem: complexity and polyhedral properties (Q322558) (← links)
- Models and solution procedures for the resource-constrained project scheduling problem with general temporal constraints and calendars (Q322689) (← links)
- Optimal berth allocation, time-variant quay crane assignment and scheduling with crane setups in container terminals (Q323449) (← links)
- Finding a contra-risk path between two nodes in undirected graphs (Q326494) (← links)
- Packing feedback arc sets in reducible flow graphs (Q326500) (← links)
- Networked control challenges in collaborative road freight transport (Q328163) (← links)
- It is difficult to tell if there is a Condorcet spanning tree (Q328521) (← links)
- Efficient approximation algorithms for computing \(k\) disjoint constrained shortest paths (Q328701) (← links)
- Reliability-based economic model predictive control for generalised flow-based networks including actuators' health-aware capabilities (Q328906) (← links)
- An algorithm for self-organization of driverless vehicles of a car-rental service (Q332734) (← links)
- A sparse multiscale algorithm for dense optimal transport (Q334276) (← links)
- Polyhedral combinatorics of the \(K\)-partitioning problem with representative variables (Q335322) (← links)
- The value of information in stochastic maximum flow problems (Q336360) (← links)
- A survey of models and algorithms for emergency response logistics in electric distribution systems. II: Contingency planning level (Q336405) (← links)
- A branch-and-bound algorithm for the acyclic partitioning problem (Q336782) (← links)
- The asymmetric bottleneck traveling salesman problem: algorithms, complexity and empirical analysis (Q336878) (← links)
- On exact solutions for the minmax regret spanning tree problem (Q337033) (← links)
- On finding representative non-dominated points for bi-objective integer network flow problems (Q337035) (← links)
- A lower bound for the quickest path problem (Q337093) (← links)
- A flow allocation strategy for routing over multiple flow classes with an application to air cargo terminals (Q337099) (← links)
- Recoverable robust single day aircraft maintenance routing problem (Q337121) (← links)
- A Dijkstra-like method computing all extreme supported non-dominated solutions of the biobjective shortest path problem (Q337491) (← links)
- A novel passenger recovery approach for the integrated airline recovery problem (Q337498) (← links)
- A tabu search algorithm for the multi-period inspector scheduling problem (Q337536) (← links)
- Mixed integer non-linear programming models for green network design (Q339579) (← links)
- Evacuation modeling: a case study on linear and nonlinear network flow models (Q339928) (← links)
- Applying ranking and selection procedures to long-term mitigation for improved network restoration (Q339947) (← links)
- Load-dependent and precedence-based models for pickup and delivery problems (Q342036) (← links)
- Bin packing and related problems: general arc-flow formulation with graph compression (Q342316) (← links)
- New reformulations of distributionally robust shortest path problem (Q342487) (← links)
- A variable fixing heuristic with local branching for the fixed charge uncapacitated network design problem with user-optimal flow (Q342561) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- On the quantification of nomination feasibility in stationary gas networks with random load (Q343824) (← links)
- Reconstructing binary matrices with timetabling constraints (Q350725) (← links)
- Approximating Wardrop equilibria with finitely many agents (Q352247) (← links)
- A model-based approach and analysis for multi-period networks (Q353173) (← links)
- Topology optimisation of repairable flow networks for a maximum average availability (Q356397) (← links)
- Cycle-based reducibility of multi-index transport-type systems of linear inequalities (Q357096) (← links)
- The maximum flow problem with disjunctive constraints (Q358660) (← links)
- MineLib: a library of open pit mining problems (Q363555) (← links)
- The capacity expansion path problem in networks (Q364264) (← links)
- Flow location (FlowLoc) problems: dynamic network flows and location models for evacuation planning (Q367642) (← links)
- Lower and upper bounds for the spanning tree with minimum branch vertices (Q377727) (← links)
- Bicriteria path problem minimizing the cost and minimizing the number of labels (Q385462) (← links)
- Distributed strategies for generating weight-balanced and doubly stochastic digraphs (Q389827) (← links)
