15 problems
- 0 votes0 replies2 views
Extension of Steiner network adaptation to soft-obstacle entry and exit points
Let a Steiner network have terminal nodes, Steiner nodes, and entry/exit points on the boundaries of soft obstacles. After perturbing the terminal nodes, consider the positions of…
- 0 votes0 replies0 views
Conjecture that significant complexity-cost savings require abandoning unprofitable markets
The network-reduction strategy may eliminate facilities and either abandon the associated demand nodes or reassign them to facilities that remain open. The complexity-cost savings…
- 0 votes0 replies0 views
The polygonal optimal-network conjecture for phases
Let be the number of phases, let denote an optimal free network, and let denote the regular polygonal network associated with the -phase con…
- 0 votes0 replies0 views
The initial-discrepancy conjecture for auction path planning
Initial-discrepancy conjecture. If all the discrepancies are initially bounded by a small multiple of , then the path produced by the algorithm upon termination…
- 0 votes0 replies0 views
The maximum-degree phase-transition conjecture for optimal resistor networks
Maximum-degree phase-transition conjecture. There is a threshold on the average degree such that below it an optimal graph has a vertex of degree , whereas ab…
- 0 votes0 replies0 views
The leaf-density phase-transition conjecture for optimal resistor networks
Leaf-density phase-transition conjecture. There is a threshold on the average degree such that below it all optimal graphs have a positive proportion of leaves, whereas…
- 0 votes0 replies0 views
The convex lower-bound conjecture for optimal resistor networks
Convex lower-bound conjecture. For all ,
- 0 votes0 replies0 views
Conjecture on network-size-independent convergence complexity of the CDS method
Let be the network size, and consider the complexity of (iib), namely, the number of evaluations required for convergence divided by the size of the feasible discrete neighborh…
- 0 votes0 replies0 views
Boundary-condition diffusion conjecture for message passing on undirected flow networks
Boundary-condition diffusion conjecture. The influence of the single-node boundary conditions under Method I takes more iteration steps to diffuse messages to the bulk of the netwo…
- 0 votes0 replies0 views
Non-local toll updates for bilevel message-passing algorithms in atomic routing games
In atomic routing games, let denote the toll-dependent equilibrium flow on edge , and let denote the flow minimizing the social cost during the upper-level…
- 0 votes0 replies0 views
Conjecture on the agreement of centralized and capacity-constrained strategies
Let CP denote the strategy that oversees the whole alliance network and makes accept-reject decisions for all partners. Let CCS denote the strategy in which airlines share informat…
- 0 votes0 replies0 views
Monotonicity of line-network allocation under the AC power flow model
Monotonicity conjecture. This monotonicity holds for a line network under the AC power flow model. The property is known for line networks under the linearized Distflow model, and…
- 0 votes0 replies1 view
The pressure-gradient control conjecture for Physarum tubular channels
Pressure-gradient control conjecture. Pressure gradients, rather than sheer flow amounts, control the response of the tubular channels; consequently, the controlling variables are…
- 0 votes0 replies0 views
Conjecture that the compact tree formulation does not determine the T-cut polyhedron
Let be the set of terminals and let the -cut polyhedron be the polyhedron associated with -cuts. The system consists of constraints,, and -. The compact tree formulation…
- 0 votes0 replies0 views
Near-optimality of the dynamic piecewise-static solution for weighted sum download time
In the one-to-many file-transfer problem, let the dynamic piecewise-static solution choose an ordering of peers and allocate transmission rates across epochs, with finite downlink…